/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-13 18:41:09,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-13 18:41:09,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-13 18:41:09,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-13 18:41:09,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-13 18:41:09,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-13 18:41:09,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-13 18:41:09,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-13 18:41:09,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-13 18:41:09,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-13 18:41:09,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-13 18:41:09,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-13 18:41:09,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-13 18:41:09,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-13 18:41:09,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-13 18:41:09,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-13 18:41:09,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-13 18:41:09,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-13 18:41:09,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-13 18:41:09,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-13 18:41:09,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-13 18:41:09,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-13 18:41:09,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-13 18:41:09,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-13 18:41:09,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-13 18:41:09,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-13 18:41:09,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-13 18:41:09,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-13 18:41:09,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-13 18:41:09,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-13 18:41:09,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-13 18:41:09,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-13 18:41:09,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-13 18:41:09,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-13 18:41:09,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-13 18:41:09,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-13 18:41:09,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-13 18:41:09,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-13 18:41:09,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-13 18:41:09,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-13 18:41:09,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-13 18:41:09,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-07-13 18:41:09,167 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-13 18:41:09,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-13 18:41:09,167 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-13 18:41:09,167 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-13 18:41:09,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-13 18:41:09,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-13 18:41:09,169 INFO L138 SettingsManager]: * Use SBE=true [2021-07-13 18:41:09,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-13 18:41:09,169 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-13 18:41:09,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-13 18:41:09,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-13 18:41:09,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-13 18:41:09,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-13 18:41:09,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-13 18:41:09,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-13 18:41:09,170 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-13 18:41:09,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-13 18:41:09,170 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-13 18:41:09,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-13 18:41:09,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-13 18:41:09,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-13 18:41:09,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-13 18:41:09,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-13 18:41:09,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 18:41:09,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-13 18:41:09,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-13 18:41:09,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-13 18:41:09,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-13 18:41:09,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-13 18:41:09,172 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-13 18:41:09,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-13 18:41:09,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-07-13 18:41:09,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-13 18:41:09,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-13 18:41:09,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-13 18:41:09,426 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-13 18:41:09,428 INFO L275 PluginConnector]: CDTParser initialized [2021-07-13 18:41:09,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i [2021-07-13 18:41:09,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6bfc5cb/1a51912de2ae4b7295e09904565feb79/FLAGca32b5229 [2021-07-13 18:41:09,884 INFO L306 CDTParser]: Found 1 translation units. [2021-07-13 18:41:09,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i [2021-07-13 18:41:09,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6bfc5cb/1a51912de2ae4b7295e09904565feb79/FLAGca32b5229 [2021-07-13 18:41:10,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6bfc5cb/1a51912de2ae4b7295e09904565feb79 [2021-07-13 18:41:10,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-13 18:41:10,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-13 18:41:10,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-13 18:41:10,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-13 18:41:10,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-13 18:41:10,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ba199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10, skipping insertion in model container [2021-07-13 18:41:10,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-13 18:41:10,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-13 18:41:10,433 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/mix030_rmo.opt.i[948,961] [2021-07-13 18:41:10,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:41:10,649 INFO L203 MainTranslator]: Completed pre-run [2021-07-13 18:41:10,657 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/mix030_rmo.opt.i[948,961] [2021-07-13 18:41:10,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:41:10,712 INFO L208 MainTranslator]: Completed translation [2021-07-13 18:41:10,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10 WrapperNode [2021-07-13 18:41:10,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-13 18:41:10,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-13 18:41:10,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-13 18:41:10,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-13 18:41:10,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-13 18:41:10,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-13 18:41:10,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-13 18:41:10,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-13 18:41:10,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (1/1) ... [2021-07-13 18:41:10,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-13 18:41:10,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-13 18:41:10,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-13 18:41:10,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-13 18:41:10,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 18:41:10,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-13 18:41:10,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-13 18:41:10,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-13 18:41:10,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-13 18:41:10,857 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-13 18:41:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-13 18:41:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-13 18:41:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-13 18:41:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-13 18:41:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-13 18:41:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-07-13 18:41:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-07-13 18:41:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-13 18:41:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-13 18:41:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-13 18:41:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-13 18:41:10,860 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-13 18:41:12,461 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-13 18:41:12,461 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-13 18:41:12,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:41:12 BoogieIcfgContainer [2021-07-13 18:41:12,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-13 18:41:12,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-13 18:41:12,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-13 18:41:12,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-13 18:41:12,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:41:10" (1/3) ... [2021-07-13 18:41:12,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e39143f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:41:12, skipping insertion in model container [2021-07-13 18:41:12,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:10" (2/3) ... [2021-07-13 18:41:12,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e39143f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:41:12, skipping insertion in model container [2021-07-13 18:41:12,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:41:12" (3/3) ... [2021-07-13 18:41:12,469 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_rmo.opt.i [2021-07-13 18:41:12,473 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-13 18:41:12,473 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-13 18:41:12,473 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-13 18:41:12,474 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-13 18:41:12,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,499 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,499 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,529 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,529 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,529 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,530 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,538 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,538 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,538 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,538 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,538 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,539 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,539 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,539 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,539 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,539 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,547 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,547 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,547 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:12,550 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-13 18:41:12,564 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-13 18:41:12,576 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:41:12,576 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:41:12,576 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:41:12,576 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:41:12,576 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:41:12,576 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:41:12,576 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:41:12,576 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork2======== [2021-07-13 18:41:12,583 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 127 transitions, 274 flow [2021-07-13 18:41:13,795 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45508 states, 45506 states have (on average 4.279018151452556) internal successors, (194721), 45507 states have internal predecessors, (194721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 45508 states, 45506 states have (on average 4.279018151452556) internal successors, (194721), 45507 states have internal predecessors, (194721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-07-13 18:41:14,032 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:14,033 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:14,033 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash -386527450, now seen corresponding path program 1 times [2021-07-13 18:41:14,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:14,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468461043] [2021-07-13 18:41:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:14,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:14,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468461043] [2021-07-13 18:41:14,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468461043] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:14,285 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:14,285 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-13 18:41:14,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891502735] [2021-07-13 18:41:14,288 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 18:41:14,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 18:41:14,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:41:14,374 INFO L87 Difference]: Start difference. First operand has 45508 states, 45506 states have (on average 4.279018151452556) internal successors, (194721), 45507 states have internal predecessors, (194721), 0 states have call successors, (0), 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 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:14,847 INFO L93 Difference]: Finished difference Result 29492 states and 119043 transitions. [2021-07-13 18:41:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 18:41:14,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-07-13 18:41:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:14,871 INFO L225 Difference]: With dead ends: 29492 [2021-07-13 18:41:14,871 INFO L226 Difference]: Without dead ends: 0 [2021-07-13 18:41:14,872 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:41:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-13 18:41:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-13 18:41:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-13 18:41:14,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2021-07-13 18:41:14,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:14,886 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-13 18:41:14,886 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-13 18:41:14,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-13 18:41:14,886 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-13 18:41:14,888 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork2 was SAFE (1/2) [2021-07-13 18:41:14,889 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-07-13 18:41:14,894 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:41:14,894 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:41:14,894 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:41:14,894 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:41:14,894 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:41:14,894 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:41:14,894 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:41:14,895 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 18:41:14,901 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 127 transitions, 274 flow [2021-07-13 18:41:16,383 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 76588 states, 76586 states have (on average 4.45632361005928) internal successors, (341292), 76587 states have internal predecessors, (341292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 76588 states, 76586 states have (on average 4.45632361005928) internal successors, (341292), 76587 states have internal predecessors, (341292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-13 18:41:16,750 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:16,750 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:16,750 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:16,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1061660364, now seen corresponding path program 1 times [2021-07-13 18:41:16,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:16,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068724596] [2021-07-13 18:41:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:17,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:17,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068724596] [2021-07-13 18:41:17,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068724596] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:17,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:17,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-13 18:41:17,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479134173] [2021-07-13 18:41:17,041 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-13 18:41:17,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:17,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-13 18:41:17,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-13 18:41:17,184 INFO L87 Difference]: Start difference. First operand has 76588 states, 76586 states have (on average 4.45632361005928) internal successors, (341292), 76587 states have internal predecessors, (341292), 0 states have call successors, (0), 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 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:18,703 INFO L93 Difference]: Finished difference Result 96307 states and 418779 transitions. [2021-07-13 18:41:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-13 18:41:18,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-07-13 18:41:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:19,542 INFO L225 Difference]: With dead ends: 96307 [2021-07-13 18:41:19,542 INFO L226 Difference]: Without dead ends: 72367 [2021-07-13 18:41:19,543 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 211.8ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:41:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72367 states. [2021-07-13 18:41:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72367 to 69784. [2021-07-13 18:41:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69784 states, 69782 states have (on average 4.362170760368003) internal successors, (304401), 69783 states have internal predecessors, (304401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69784 states to 69784 states and 304401 transitions. [2021-07-13 18:41:23,106 INFO L78 Accepts]: Start accepts. Automaton has 69784 states and 304401 transitions. Word has length 78 [2021-07-13 18:41:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:23,108 INFO L482 AbstractCegarLoop]: Abstraction has 69784 states and 304401 transitions. [2021-07-13 18:41:23,108 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 69784 states and 304401 transitions. [2021-07-13 18:41:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-13 18:41:23,221 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:23,221 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:23,221 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-13 18:41:23,221 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:23,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1088813707, now seen corresponding path program 1 times [2021-07-13 18:41:23,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:23,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458655565] [2021-07-13 18:41:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:23,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:23,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458655565] [2021-07-13 18:41:23,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458655565] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:23,355 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:23,355 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 18:41:23,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088146490] [2021-07-13 18:41:23,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 18:41:23,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:23,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 18:41:23,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:41:23,357 INFO L87 Difference]: Start difference. First operand 69784 states and 304401 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:24,082 INFO L93 Difference]: Finished difference Result 61832 states and 269641 transitions. [2021-07-13 18:41:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 18:41:24,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-07-13 18:41:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:24,446 INFO L225 Difference]: With dead ends: 61832 [2021-07-13 18:41:24,446 INFO L226 Difference]: Without dead ends: 61832 [2021-07-13 18:41:24,447 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:41:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61832 states. [2021-07-13 18:41:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61832 to 61832. [2021-07-13 18:41:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61832 states, 61831 states have (on average 4.360935453089874) internal successors, (269641), 61831 states have internal predecessors, (269641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61832 states to 61832 states and 269641 transitions. [2021-07-13 18:41:27,377 INFO L78 Accepts]: Start accepts. Automaton has 61832 states and 269641 transitions. Word has length 80 [2021-07-13 18:41:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:27,378 INFO L482 AbstractCegarLoop]: Abstraction has 61832 states and 269641 transitions. [2021-07-13 18:41:27,378 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 61832 states and 269641 transitions. [2021-07-13 18:41:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-13 18:41:27,449 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:27,450 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:27,450 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-13 18:41:27,450 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:27,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1494537528, now seen corresponding path program 1 times [2021-07-13 18:41:27,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:27,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050968080] [2021-07-13 18:41:27,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:27,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:27,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050968080] [2021-07-13 18:41:27,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050968080] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:27,556 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:27,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:41:27,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472452232] [2021-07-13 18:41:27,557 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:41:27,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:27,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:41:27,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:41:27,558 INFO L87 Difference]: Start difference. First operand 61832 states and 269641 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:28,468 INFO L93 Difference]: Finished difference Result 74936 states and 324483 transitions. [2021-07-13 18:41:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:41:28,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-07-13 18:41:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:29,028 INFO L225 Difference]: With dead ends: 74936 [2021-07-13 18:41:29,029 INFO L226 Difference]: Without dead ends: 60320 [2021-07-13 18:41:29,029 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 86.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:41:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60320 states. [2021-07-13 18:41:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60320 to 60320. [2021-07-13 18:41:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60320 states, 60319 states have (on average 4.352674944876407) internal successors, (262549), 60319 states have internal predecessors, (262549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60320 states to 60320 states and 262549 transitions. [2021-07-13 18:41:31,374 INFO L78 Accepts]: Start accepts. Automaton has 60320 states and 262549 transitions. Word has length 80 [2021-07-13 18:41:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:31,375 INFO L482 AbstractCegarLoop]: Abstraction has 60320 states and 262549 transitions. [2021-07-13 18:41:31,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 60320 states and 262549 transitions. [2021-07-13 18:41:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-13 18:41:31,443 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:31,443 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:31,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-13 18:41:31,444 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash -158736966, now seen corresponding path program 1 times [2021-07-13 18:41:31,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:31,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627847004] [2021-07-13 18:41:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:31,508 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:31,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627847004] [2021-07-13 18:41:31,508 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627847004] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:31,508 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:31,508 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:41:31,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139616994] [2021-07-13 18:41:31,508 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:41:31,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:31,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:41:31,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:41:31,509 INFO L87 Difference]: Start difference. First operand 60320 states and 262549 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:32,820 INFO L93 Difference]: Finished difference Result 104280 states and 449462 transitions. [2021-07-13 18:41:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:41:32,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-07-13 18:41:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:33,197 INFO L225 Difference]: With dead ends: 104280 [2021-07-13 18:41:33,197 INFO L226 Difference]: Without dead ends: 68720 [2021-07-13 18:41:33,198 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 66.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:41:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68720 states. [2021-07-13 18:41:35,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68720 to 56960. [2021-07-13 18:41:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56960 states, 56959 states have (on average 4.280148879018241) internal successors, (243793), 56959 states have internal predecessors, (243793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56960 states to 56960 states and 243793 transitions. [2021-07-13 18:41:35,694 INFO L78 Accepts]: Start accepts. Automaton has 56960 states and 243793 transitions. Word has length 81 [2021-07-13 18:41:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:35,694 INFO L482 AbstractCegarLoop]: Abstraction has 56960 states and 243793 transitions. [2021-07-13 18:41:35,694 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 56960 states and 243793 transitions. [2021-07-13 18:41:35,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-13 18:41:35,760 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:35,760 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:35,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-13 18:41:35,760 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:35,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:35,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2082581959, now seen corresponding path program 1 times [2021-07-13 18:41:35,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:35,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221387195] [2021-07-13 18:41:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:35,848 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:35,849 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221387195] [2021-07-13 18:41:35,849 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221387195] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:35,849 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:35,849 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:41:35,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682890449] [2021-07-13 18:41:35,849 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:41:35,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:35,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:41:35,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:41:35,850 INFO L87 Difference]: Start difference. First operand 56960 states and 243793 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:36,747 INFO L93 Difference]: Finished difference Result 65892 states and 280653 transitions. [2021-07-13 18:41:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:41:36,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-07-13 18:41:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:36,993 INFO L225 Difference]: With dead ends: 65892 [2021-07-13 18:41:36,993 INFO L226 Difference]: Without dead ends: 54524 [2021-07-13 18:41:36,994 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 67.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:41:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54524 states. [2021-07-13 18:41:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54524 to 54524. [2021-07-13 18:41:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54524 states, 54523 states have (on average 4.266694789354951) internal successors, (232633), 54523 states have internal predecessors, (232633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54524 states to 54524 states and 232633 transitions. [2021-07-13 18:41:39,092 INFO L78 Accepts]: Start accepts. Automaton has 54524 states and 232633 transitions. Word has length 82 [2021-07-13 18:41:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:39,093 INFO L482 AbstractCegarLoop]: Abstraction has 54524 states and 232633 transitions. [2021-07-13 18:41:39,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 54524 states and 232633 transitions. [2021-07-13 18:41:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-07-13 18:41:39,165 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:39,165 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:39,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-13 18:41:39,165 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:39,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1799743632, now seen corresponding path program 1 times [2021-07-13 18:41:39,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:39,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699848196] [2021-07-13 18:41:39,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:39,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:39,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699848196] [2021-07-13 18:41:39,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699848196] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:39,257 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:39,257 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:41:39,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536295852] [2021-07-13 18:41:39,257 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:41:39,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:39,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:41:39,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:41:39,258 INFO L87 Difference]: Start difference. First operand 54524 states and 232633 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:40,134 INFO L93 Difference]: Finished difference Result 61292 states and 260257 transitions. [2021-07-13 18:41:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:41:40,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-07-13 18:41:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:40,612 INFO L225 Difference]: With dead ends: 61292 [2021-07-13 18:41:40,613 INFO L226 Difference]: Without dead ends: 53228 [2021-07-13 18:41:40,613 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 77.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:41:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53228 states. [2021-07-13 18:41:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53228 to 53228. [2021-07-13 18:41:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53228 states, 53227 states have (on average 4.256956056136923) internal successors, (226585), 53227 states have internal predecessors, (226585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53228 states to 53228 states and 226585 transitions. [2021-07-13 18:41:42,616 INFO L78 Accepts]: Start accepts. Automaton has 53228 states and 226585 transitions. Word has length 83 [2021-07-13 18:41:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:42,617 INFO L482 AbstractCegarLoop]: Abstraction has 53228 states and 226585 transitions. [2021-07-13 18:41:42,617 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 53228 states and 226585 transitions. [2021-07-13 18:41:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-13 18:41:42,704 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:42,704 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:42,704 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-13 18:41:42,704 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash 425204255, now seen corresponding path program 1 times [2021-07-13 18:41:42,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:42,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601212190] [2021-07-13 18:41:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:42,931 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:42,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601212190] [2021-07-13 18:41:42,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601212190] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:42,931 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:42,931 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:41:42,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631804277] [2021-07-13 18:41:42,932 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:41:42,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:42,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:41:42,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:41:42,932 INFO L87 Difference]: Start difference. First operand 53228 states and 226585 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:44,055 INFO L93 Difference]: Finished difference Result 60508 states and 256751 transitions. [2021-07-13 18:41:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-13 18:41:44,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-07-13 18:41:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:44,681 INFO L225 Difference]: With dead ends: 60508 [2021-07-13 18:41:44,681 INFO L226 Difference]: Without dead ends: 53564 [2021-07-13 18:41:44,682 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 222.1ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:41:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53564 states. [2021-07-13 18:41:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53564 to 53564. [2021-07-13 18:41:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53564 states, 53563 states have (on average 4.2573231521759425) internal successors, (228035), 53563 states have internal predecessors, (228035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53564 states to 53564 states and 228035 transitions. [2021-07-13 18:41:46,507 INFO L78 Accepts]: Start accepts. Automaton has 53564 states and 228035 transitions. Word has length 84 [2021-07-13 18:41:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:46,508 INFO L482 AbstractCegarLoop]: Abstraction has 53564 states and 228035 transitions. [2021-07-13 18:41:46,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 53564 states and 228035 transitions. [2021-07-13 18:41:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-13 18:41:46,586 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:46,586 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:46,586 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-13 18:41:46,587 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:46,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:46,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1467462400, now seen corresponding path program 1 times [2021-07-13 18:41:46,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:46,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366967198] [2021-07-13 18:41:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:46,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:46,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366967198] [2021-07-13 18:41:46,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366967198] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:46,772 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:46,772 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-13 18:41:46,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844775494] [2021-07-13 18:41:46,773 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-13 18:41:46,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:46,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-13 18:41:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-07-13 18:41:46,774 INFO L87 Difference]: Start difference. First operand 53564 states and 228035 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:47,702 INFO L93 Difference]: Finished difference Result 61180 states and 259371 transitions. [2021-07-13 18:41:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:41:47,703 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-07-13 18:41:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:48,181 INFO L225 Difference]: With dead ends: 61180 [2021-07-13 18:41:48,182 INFO L226 Difference]: Without dead ends: 54908 [2021-07-13 18:41:48,182 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 214.5ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-07-13 18:41:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54908 states. [2021-07-13 18:41:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54908 to 54908. [2021-07-13 18:41:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54908 states, 54907 states have (on average 4.252627169577649) internal successors, (233499), 54907 states have internal predecessors, (233499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54908 states to 54908 states and 233499 transitions. [2021-07-13 18:41:50,058 INFO L78 Accepts]: Start accepts. Automaton has 54908 states and 233499 transitions. Word has length 85 [2021-07-13 18:41:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:50,058 INFO L482 AbstractCegarLoop]: Abstraction has 54908 states and 233499 transitions. [2021-07-13 18:41:50,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 54908 states and 233499 transitions. [2021-07-13 18:41:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-13 18:41:50,440 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:50,440 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:50,440 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-13 18:41:50,440 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1509607535, now seen corresponding path program 1 times [2021-07-13 18:41:50,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:50,452 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575037088] [2021-07-13 18:41:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:50,613 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:50,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575037088] [2021-07-13 18:41:50,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575037088] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:50,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:50,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:41:50,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262453138] [2021-07-13 18:41:50,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:41:50,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:50,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:41:50,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:41:50,614 INFO L87 Difference]: Start difference. First operand 54908 states and 233499 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:51,486 INFO L93 Difference]: Finished difference Result 62984 states and 266238 transitions. [2021-07-13 18:41:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:41:51,486 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-07-13 18:41:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:51,742 INFO L225 Difference]: With dead ends: 62984 [2021-07-13 18:41:51,742 INFO L226 Difference]: Without dead ends: 55304 [2021-07-13 18:41:51,743 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 141.4ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:41:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55304 states. [2021-07-13 18:41:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55304 to 55304. [2021-07-13 18:41:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55304 states, 55303 states have (on average 4.238721226696563) internal successors, (234414), 55303 states have internal predecessors, (234414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55304 states to 55304 states and 234414 transitions. [2021-07-13 18:41:53,934 INFO L78 Accepts]: Start accepts. Automaton has 55304 states and 234414 transitions. Word has length 85 [2021-07-13 18:41:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:53,934 INFO L482 AbstractCegarLoop]: Abstraction has 55304 states and 234414 transitions. [2021-07-13 18:41:53,934 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 55304 states and 234414 transitions. [2021-07-13 18:41:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-13 18:41:54,074 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:54,074 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:54,074 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-13 18:41:54,074 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash 855193005, now seen corresponding path program 1 times [2021-07-13 18:41:54,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:54,075 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951192805] [2021-07-13 18:41:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:54,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:54,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951192805] [2021-07-13 18:41:54,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951192805] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:54,223 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:54,223 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-13 18:41:54,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847611209] [2021-07-13 18:41:54,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 18:41:54,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:54,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 18:41:54,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:41:54,224 INFO L87 Difference]: Start difference. First operand 55304 states and 234414 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:55,156 INFO L93 Difference]: Finished difference Result 61674 states and 260510 transitions. [2021-07-13 18:41:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:41:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-07-13 18:41:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:55,408 INFO L225 Difference]: With dead ends: 61674 [2021-07-13 18:41:55,408 INFO L226 Difference]: Without dead ends: 56410 [2021-07-13 18:41:55,408 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 173.1ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-07-13 18:41:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56410 states. [2021-07-13 18:41:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56410 to 56410. [2021-07-13 18:41:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56410 states, 56409 states have (on average 4.235955255367052) internal successors, (238946), 56409 states have internal predecessors, (238946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56410 states to 56410 states and 238946 transitions. [2021-07-13 18:41:57,738 INFO L78 Accepts]: Start accepts. Automaton has 56410 states and 238946 transitions. Word has length 86 [2021-07-13 18:41:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:57,738 INFO L482 AbstractCegarLoop]: Abstraction has 56410 states and 238946 transitions. [2021-07-13 18:41:57,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 56410 states and 238946 transitions. [2021-07-13 18:41:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-13 18:41:57,857 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:57,857 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:57,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-13 18:41:57,857 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:57,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:57,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1472720931, now seen corresponding path program 2 times [2021-07-13 18:41:57,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:57,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764220364] [2021-07-13 18:41:57,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:57,977 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:57,977 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764220364] [2021-07-13 18:41:57,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764220364] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:57,977 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:57,977 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-13 18:41:57,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391070676] [2021-07-13 18:41:57,978 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-13 18:41:57,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:57,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-13 18:41:57,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-07-13 18:41:57,978 INFO L87 Difference]: Start difference. First operand 56410 states and 238946 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:58,852 INFO L93 Difference]: Finished difference Result 66490 states and 281172 transitions. [2021-07-13 18:41:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-13 18:41:58,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-07-13 18:41:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:59,113 INFO L225 Difference]: With dead ends: 66490 [2021-07-13 18:41:59,113 INFO L226 Difference]: Without dead ends: 60554 [2021-07-13 18:41:59,113 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 127.9ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:41:59,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60554 states. [2021-07-13 18:42:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60554 to 58104. [2021-07-13 18:42:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58104 states, 58103 states have (on average 4.23840421320758) internal successors, (246264), 58103 states have internal predecessors, (246264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58104 states to 58104 states and 246264 transitions. [2021-07-13 18:42:01,348 INFO L78 Accepts]: Start accepts. Automaton has 58104 states and 246264 transitions. Word has length 86 [2021-07-13 18:42:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:01,348 INFO L482 AbstractCegarLoop]: Abstraction has 58104 states and 246264 transitions. [2021-07-13 18:42:01,348 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 58104 states and 246264 transitions. [2021-07-13 18:42:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-13 18:42:01,449 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:01,449 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:01,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-13 18:42:01,449 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:01,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:01,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1113078432, now seen corresponding path program 1 times [2021-07-13 18:42:01,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:01,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535688913] [2021-07-13 18:42:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:01,611 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:01,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535688913] [2021-07-13 18:42:01,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535688913] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:01,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:01,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:42:01,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026482746] [2021-07-13 18:42:01,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:42:01,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:01,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:42:01,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:42:01,612 INFO L87 Difference]: Start difference. First operand 58104 states and 246264 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:02,453 INFO L93 Difference]: Finished difference Result 60904 states and 257204 transitions. [2021-07-13 18:42:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-13 18:42:02,454 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-07-13 18:42:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:02,948 INFO L225 Difference]: With dead ends: 60904 [2021-07-13 18:42:02,948 INFO L226 Difference]: Without dead ends: 56424 [2021-07-13 18:42:02,948 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 169.6ms TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-07-13 18:42:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56424 states. [2021-07-13 18:42:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56424 to 54408. [2021-07-13 18:42:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54408 states, 54407 states have (on average 4.232911206278604) internal successors, (230300), 54407 states have internal predecessors, (230300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54408 states to 54408 states and 230300 transitions. [2021-07-13 18:42:05,156 INFO L78 Accepts]: Start accepts. Automaton has 54408 states and 230300 transitions. Word has length 86 [2021-07-13 18:42:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:05,156 INFO L482 AbstractCegarLoop]: Abstraction has 54408 states and 230300 transitions. [2021-07-13 18:42:05,156 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 54408 states and 230300 transitions. [2021-07-13 18:42:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-13 18:42:05,250 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:05,250 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:05,250 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-13 18:42:05,250 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1226296242, now seen corresponding path program 1 times [2021-07-13 18:42:05,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:05,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670763346] [2021-07-13 18:42:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:05,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:05,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670763346] [2021-07-13 18:42:05,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670763346] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:05,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:05,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-13 18:42:05,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738176052] [2021-07-13 18:42:05,701 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-13 18:42:05,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-13 18:42:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-07-13 18:42:05,702 INFO L87 Difference]: Start difference. First operand 54408 states and 230300 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:06,590 INFO L93 Difference]: Finished difference Result 65160 states and 273473 transitions. [2021-07-13 18:42:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-13 18:42:06,591 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-07-13 18:42:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:06,855 INFO L225 Difference]: With dead ends: 65160 [2021-07-13 18:42:06,856 INFO L226 Difference]: Without dead ends: 56536 [2021-07-13 18:42:06,856 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 187.6ms TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:42:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56536 states. [2021-07-13 18:42:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56536 to 54800. [2021-07-13 18:42:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54800 states, 54799 states have (on average 4.205441705140605) internal successors, (230454), 54799 states have internal predecessors, (230454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54800 states to 54800 states and 230454 transitions. [2021-07-13 18:42:08,701 INFO L78 Accepts]: Start accepts. Automaton has 54800 states and 230454 transitions. Word has length 87 [2021-07-13 18:42:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:08,701 INFO L482 AbstractCegarLoop]: Abstraction has 54800 states and 230454 transitions. [2021-07-13 18:42:08,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 54800 states and 230454 transitions. [2021-07-13 18:42:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-13 18:42:09,108 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:09,108 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:09,108 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-13 18:42:09,109 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1087591396, now seen corresponding path program 2 times [2021-07-13 18:42:09,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:09,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503632804] [2021-07-13 18:42:09,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:09,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:09,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503632804] [2021-07-13 18:42:09,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503632804] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:09,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:09,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-13 18:42:09,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498051693] [2021-07-13 18:42:09,254 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-13 18:42:09,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:09,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-13 18:42:09,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-07-13 18:42:09,255 INFO L87 Difference]: Start difference. First operand 54800 states and 230454 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:10,286 INFO L93 Difference]: Finished difference Result 65202 states and 271934 transitions. [2021-07-13 18:42:10,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-13 18:42:10,287 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-07-13 18:42:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:10,544 INFO L225 Difference]: With dead ends: 65202 [2021-07-13 18:42:10,545 INFO L226 Difference]: Without dead ends: 58958 [2021-07-13 18:42:10,545 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 189.2ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:42:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58958 states. [2021-07-13 18:42:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58958 to 56046. [2021-07-13 18:42:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56046 states, 56045 states have (on average 4.19732357926666) internal successors, (235239), 56045 states have internal predecessors, (235239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56046 states to 56046 states and 235239 transitions. [2021-07-13 18:42:12,670 INFO L78 Accepts]: Start accepts. Automaton has 56046 states and 235239 transitions. Word has length 87 [2021-07-13 18:42:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:12,671 INFO L482 AbstractCegarLoop]: Abstraction has 56046 states and 235239 transitions. [2021-07-13 18:42:12,672 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 56046 states and 235239 transitions. [2021-07-13 18:42:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-13 18:42:12,779 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:12,779 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:12,779 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-13 18:42:12,780 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:12,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:12,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1724993808, now seen corresponding path program 3 times [2021-07-13 18:42:12,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:12,780 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057150273] [2021-07-13 18:42:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:12,974 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:12,974 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057150273] [2021-07-13 18:42:12,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057150273] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:12,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:12,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:42:12,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723949433] [2021-07-13 18:42:12,976 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:42:12,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:12,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:42:12,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:42:12,977 INFO L87 Difference]: Start difference. First operand 56046 states and 235239 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:13,699 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2021-07-13 18:42:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:14,046 INFO L93 Difference]: Finished difference Result 62584 states and 260695 transitions. [2021-07-13 18:42:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-13 18:42:14,046 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-07-13 18:42:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:14,282 INFO L225 Difference]: With dead ends: 62584 [2021-07-13 18:42:14,283 INFO L226 Difference]: Without dead ends: 55444 [2021-07-13 18:42:14,283 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 619.1ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-07-13 18:42:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55444 states. [2021-07-13 18:42:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55444 to 55024. [2021-07-13 18:42:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55024 states, 55023 states have (on average 4.2026243570870365) internal successors, (231241), 55023 states have internal predecessors, (231241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55024 states to 55024 states and 231241 transitions. [2021-07-13 18:42:16,328 INFO L78 Accepts]: Start accepts. Automaton has 55024 states and 231241 transitions. Word has length 87 [2021-07-13 18:42:16,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:16,328 INFO L482 AbstractCegarLoop]: Abstraction has 55024 states and 231241 transitions. [2021-07-13 18:42:16,328 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:16,328 INFO L276 IsEmpty]: Start isEmpty. Operand 55024 states and 231241 transitions. [2021-07-13 18:42:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-13 18:42:16,439 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:16,439 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:16,439 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-13 18:42:16,439 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash -889594318, now seen corresponding path program 1 times [2021-07-13 18:42:16,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:16,440 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123864407] [2021-07-13 18:42:16,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:16,647 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:16,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123864407] [2021-07-13 18:42:16,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123864407] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:16,648 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:16,648 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:42:16,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213599155] [2021-07-13 18:42:16,648 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:42:16,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:16,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:42:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:42:16,649 INFO L87 Difference]: Start difference. First operand 55024 states and 231241 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:17,694 INFO L93 Difference]: Finished difference Result 60552 states and 253221 transitions. [2021-07-13 18:42:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-13 18:42:17,695 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-07-13 18:42:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:17,916 INFO L225 Difference]: With dead ends: 60552 [2021-07-13 18:42:17,917 INFO L226 Difference]: Without dead ends: 55752 [2021-07-13 18:42:17,917 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 342.5ms TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2021-07-13 18:42:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55752 states. [2021-07-13 18:42:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55752 to 54646. [2021-07-13 18:42:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54646 states, 54645 states have (on average 4.206551377070181) internal successors, (229867), 54645 states have internal predecessors, (229867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54646 states to 54646 states and 229867 transitions. [2021-07-13 18:42:19,924 INFO L78 Accepts]: Start accepts. Automaton has 54646 states and 229867 transitions. Word has length 87 [2021-07-13 18:42:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:19,924 INFO L482 AbstractCegarLoop]: Abstraction has 54646 states and 229867 transitions. [2021-07-13 18:42:19,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 54646 states and 229867 transitions. [2021-07-13 18:42:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-13 18:42:20,018 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:20,018 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:20,018 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-13 18:42:20,019 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:20,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:20,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1557815994, now seen corresponding path program 2 times [2021-07-13 18:42:20,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:20,019 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942372267] [2021-07-13 18:42:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:20,203 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:20,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942372267] [2021-07-13 18:42:20,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942372267] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:20,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:20,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-07-13 18:42:20,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904794829] [2021-07-13 18:42:20,203 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-07-13 18:42:20,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:20,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-07-13 18:42:20,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-07-13 18:42:20,204 INFO L87 Difference]: Start difference. First operand 54646 states and 229867 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:21,113 INFO L93 Difference]: Finished difference Result 58726 states and 246071 transitions. [2021-07-13 18:42:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:42:21,114 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-07-13 18:42:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:21,546 INFO L225 Difference]: With dead ends: 58726 [2021-07-13 18:42:21,547 INFO L226 Difference]: Without dead ends: 53926 [2021-07-13 18:42:21,547 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 279.8ms TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2021-07-13 18:42:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53926 states. [2021-07-13 18:42:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53926 to 53548. [2021-07-13 18:42:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53548 states, 53547 states have (on average 4.207929482510692) internal successors, (225322), 53547 states have internal predecessors, (225322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53548 states to 53548 states and 225322 transitions. [2021-07-13 18:42:23,361 INFO L78 Accepts]: Start accepts. Automaton has 53548 states and 225322 transitions. Word has length 87 [2021-07-13 18:42:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:23,362 INFO L482 AbstractCegarLoop]: Abstraction has 53548 states and 225322 transitions. [2021-07-13 18:42:23,362 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 53548 states and 225322 transitions. [2021-07-13 18:42:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-13 18:42:23,453 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:23,453 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:23,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-13 18:42:23,454 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash -864779378, now seen corresponding path program 4 times [2021-07-13 18:42:23,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:23,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426793950] [2021-07-13 18:42:23,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:23,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:23,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426793950] [2021-07-13 18:42:23,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426793950] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:23,661 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:23,661 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:42:23,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254825077] [2021-07-13 18:42:23,661 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:42:23,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:23,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:42:23,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:42:23,662 INFO L87 Difference]: Start difference. First operand 53548 states and 225322 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:25,034 INFO L93 Difference]: Finished difference Result 77404 states and 321958 transitions. [2021-07-13 18:42:25,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-13 18:42:25,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-07-13 18:42:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:25,622 INFO L225 Difference]: With dead ends: 77404 [2021-07-13 18:42:25,623 INFO L226 Difference]: Without dead ends: 61220 [2021-07-13 18:42:25,623 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 240.2ms TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:42:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61220 states. [2021-07-13 18:42:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61220 to 52540. [2021-07-13 18:42:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52540 states, 52539 states have (on average 4.181617465121148) internal successors, (219698), 52539 states have internal predecessors, (219698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52540 states to 52540 states and 219698 transitions. [2021-07-13 18:42:27,900 INFO L78 Accepts]: Start accepts. Automaton has 52540 states and 219698 transitions. Word has length 87 [2021-07-13 18:42:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:27,901 INFO L482 AbstractCegarLoop]: Abstraction has 52540 states and 219698 transitions. [2021-07-13 18:42:27,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 52540 states and 219698 transitions. [2021-07-13 18:42:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-13 18:42:27,995 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:27,995 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:27,995 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-13 18:42:27,995 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:27,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:27,996 INFO L82 PathProgramCache]: Analyzing trace with hash -863827792, now seen corresponding path program 1 times [2021-07-13 18:42:27,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:27,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021418255] [2021-07-13 18:42:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:28,051 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:28,051 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021418255] [2021-07-13 18:42:28,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021418255] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:28,051 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:28,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:42:28,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806129871] [2021-07-13 18:42:28,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:42:28,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:28,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:42:28,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:42:28,052 INFO L87 Difference]: Start difference. First operand 52540 states and 219698 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:28,847 INFO L93 Difference]: Finished difference Result 65976 states and 272606 transitions. [2021-07-13 18:42:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:42:28,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-07-13 18:42:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:29,274 INFO L225 Difference]: With dead ends: 65976 [2021-07-13 18:42:29,275 INFO L226 Difference]: Without dead ends: 48616 [2021-07-13 18:42:29,275 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 58.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:42:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48616 states. [2021-07-13 18:42:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48616 to 48616. [2021-07-13 18:42:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48616 states, 48615 states have (on average 4.130864959374678) internal successors, (200822), 48615 states have internal predecessors, (200822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48616 states to 48616 states and 200822 transitions. [2021-07-13 18:42:30,920 INFO L78 Accepts]: Start accepts. Automaton has 48616 states and 200822 transitions. Word has length 87 [2021-07-13 18:42:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:30,920 INFO L482 AbstractCegarLoop]: Abstraction has 48616 states and 200822 transitions. [2021-07-13 18:42:30,920 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 48616 states and 200822 transitions. [2021-07-13 18:42:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-13 18:42:31,017 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:31,017 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:31,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-13 18:42:31,017 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1202278416, now seen corresponding path program 1 times [2021-07-13 18:42:31,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:31,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832386402] [2021-07-13 18:42:31,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:31,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:31,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832386402] [2021-07-13 18:42:31,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832386402] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:31,079 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:31,079 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:42:31,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525975490] [2021-07-13 18:42:31,079 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:42:31,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:31,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:42:31,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:42:31,080 INFO L87 Difference]: Start difference. First operand 48616 states and 200822 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:31,823 INFO L93 Difference]: Finished difference Result 52576 states and 212555 transitions. [2021-07-13 18:42:31,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-13 18:42:31,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-07-13 18:42:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:31,969 INFO L225 Difference]: With dead ends: 52576 [2021-07-13 18:42:31,970 INFO L226 Difference]: Without dead ends: 37600 [2021-07-13 18:42:31,970 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 66.1ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:42:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37600 states. [2021-07-13 18:42:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37600 to 37600. [2021-07-13 18:42:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37600 states, 37599 states have (on average 4.007872549801856) internal successors, (150692), 37599 states have internal predecessors, (150692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37600 states to 37600 states and 150692 transitions. [2021-07-13 18:42:33,087 INFO L78 Accepts]: Start accepts. Automaton has 37600 states and 150692 transitions. Word has length 88 [2021-07-13 18:42:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:33,087 INFO L482 AbstractCegarLoop]: Abstraction has 37600 states and 150692 transitions. [2021-07-13 18:42:33,087 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 37600 states and 150692 transitions. [2021-07-13 18:42:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-07-13 18:42:33,409 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:33,409 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:33,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-07-13 18:42:33,410 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:33,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:33,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1090322723, now seen corresponding path program 1 times [2021-07-13 18:42:33,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:33,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029486075] [2021-07-13 18:42:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:33,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-07-13 18:42:33,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:33,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029486075] [2021-07-13 18:42:33,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029486075] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:33,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:33,493 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:42:33,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050530084] [2021-07-13 18:42:33,493 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:42:33,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:33,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:42:33,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:42:33,494 INFO L87 Difference]: Start difference. First operand 37600 states and 150692 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:33,940 INFO L93 Difference]: Finished difference Result 60612 states and 240480 transitions. [2021-07-13 18:42:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:42:33,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-07-13 18:42:33,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:34,396 INFO L225 Difference]: With dead ends: 60612 [2021-07-13 18:42:34,396 INFO L226 Difference]: Without dead ends: 39328 [2021-07-13 18:42:34,396 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 65.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:42:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39328 states. [2021-07-13 18:42:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39328 to 36736. [2021-07-13 18:42:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36736 states, 36735 states have (on average 3.917354022049816) internal successors, (143904), 36735 states have internal predecessors, (143904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36736 states to 36736 states and 143904 transitions. [2021-07-13 18:42:35,464 INFO L78 Accepts]: Start accepts. Automaton has 36736 states and 143904 transitions. Word has length 90 [2021-07-13 18:42:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:35,465 INFO L482 AbstractCegarLoop]: Abstraction has 36736 states and 143904 transitions. [2021-07-13 18:42:35,465 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 36736 states and 143904 transitions. [2021-07-13 18:42:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-07-13 18:42:35,577 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:35,577 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:35,577 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-07-13 18:42:35,577 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:35,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:35,578 INFO L82 PathProgramCache]: Analyzing trace with hash 750527785, now seen corresponding path program 1 times [2021-07-13 18:42:35,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:35,578 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970493726] [2021-07-13 18:42:35,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:35,779 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:35,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970493726] [2021-07-13 18:42:35,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970493726] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:35,779 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:35,779 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-13 18:42:35,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711309283] [2021-07-13 18:42:35,779 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-13 18:42:35,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:35,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-13 18:42:35,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:42:35,780 INFO L87 Difference]: Start difference. First operand 36736 states and 143904 transitions. Second operand has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:36,614 INFO L93 Difference]: Finished difference Result 42896 states and 167109 transitions. [2021-07-13 18:42:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:42:36,615 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-07-13 18:42:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:36,756 INFO L225 Difference]: With dead ends: 42896 [2021-07-13 18:42:36,756 INFO L226 Difference]: Without dead ends: 38345 [2021-07-13 18:42:36,757 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 263.9ms TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2021-07-13 18:42:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38345 states. [2021-07-13 18:42:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38345 to 37385. [2021-07-13 18:42:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37385 states, 37384 states have (on average 3.9057885726514017) internal successors, (146014), 37384 states have internal predecessors, (146014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37385 states to 37385 states and 146014 transitions. [2021-07-13 18:42:38,080 INFO L78 Accepts]: Start accepts. Automaton has 37385 states and 146014 transitions. Word has length 91 [2021-07-13 18:42:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:38,080 INFO L482 AbstractCegarLoop]: Abstraction has 37385 states and 146014 transitions. [2021-07-13 18:42:38,080 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 37385 states and 146014 transitions. [2021-07-13 18:42:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-07-13 18:42:38,162 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:38,163 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:38,163 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-07-13 18:42:38,163 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:38,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:38,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1298791795, now seen corresponding path program 1 times [2021-07-13 18:42:38,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:38,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410107806] [2021-07-13 18:42:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:38,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:38,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410107806] [2021-07-13 18:42:38,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410107806] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:38,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:38,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-13 18:42:38,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477955934] [2021-07-13 18:42:38,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-13 18:42:38,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:38,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-13 18:42:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-13 18:42:38,227 INFO L87 Difference]: Start difference. First operand 37385 states and 146014 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:38,741 INFO L93 Difference]: Finished difference Result 34181 states and 130663 transitions. [2021-07-13 18:42:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-13 18:42:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-07-13 18:42:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:38,829 INFO L225 Difference]: With dead ends: 34181 [2021-07-13 18:42:38,829 INFO L226 Difference]: Without dead ends: 24641 [2021-07-13 18:42:38,829 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 81.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:42:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24641 states. [2021-07-13 18:42:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24641 to 22616. [2021-07-13 18:42:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22616 states, 22615 states have (on average 3.786690249834181) internal successors, (85636), 22615 states have internal predecessors, (85636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22616 states to 22616 states and 85636 transitions. [2021-07-13 18:42:39,507 INFO L78 Accepts]: Start accepts. Automaton has 22616 states and 85636 transitions. Word has length 91 [2021-07-13 18:42:39,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:39,507 INFO L482 AbstractCegarLoop]: Abstraction has 22616 states and 85636 transitions. [2021-07-13 18:42:39,507 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 22616 states and 85636 transitions. [2021-07-13 18:42:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-07-13 18:42:39,552 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:39,552 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:39,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-07-13 18:42:39,552 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:39,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:39,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1072749060, now seen corresponding path program 1 times [2021-07-13 18:42:39,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:39,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008573967] [2021-07-13 18:42:39,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:42:39,629 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:39,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008573967] [2021-07-13 18:42:39,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008573967] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:39,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:39,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-13 18:42:39,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130349266] [2021-07-13 18:42:39,630 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-13 18:42:39,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:39,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-13 18:42:39,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-07-13 18:42:39,631 INFO L87 Difference]: Start difference. First operand 22616 states and 85636 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:39,855 INFO L93 Difference]: Finished difference Result 19538 states and 73297 transitions. [2021-07-13 18:42:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:42:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2021-07-13 18:42:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:39,887 INFO L225 Difference]: With dead ends: 19538 [2021-07-13 18:42:39,887 INFO L226 Difference]: Without dead ends: 11108 [2021-07-13 18:42:39,887 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 95.3ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-07-13 18:42:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11108 states. [2021-07-13 18:42:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11108 to 8408. [2021-07-13 18:42:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8408 states, 8407 states have (on average 3.6816938265730936) internal successors, (30952), 8407 states have internal predecessors, (30952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8408 states to 8408 states and 30952 transitions. [2021-07-13 18:42:40,237 INFO L78 Accepts]: Start accepts. Automaton has 8408 states and 30952 transitions. Word has length 94 [2021-07-13 18:42:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:40,238 INFO L482 AbstractCegarLoop]: Abstraction has 8408 states and 30952 transitions. [2021-07-13 18:42:40,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 8408 states and 30952 transitions. [2021-07-13 18:42:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-07-13 18:42:40,253 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:40,253 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:40,253 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-07-13 18:42:40,253 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:40,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:40,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1909256006, now seen corresponding path program 1 times [2021-07-13 18:42:40,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:40,254 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70413203] [2021-07-13 18:42:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:42:40,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-07-13 18:42:40,318 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:42:40,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70413203] [2021-07-13 18:42:40,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70413203] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:42:40,318 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:42:40,318 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:42:40,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340891557] [2021-07-13 18:42:40,318 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:42:40,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:42:40,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:42:40,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:42:40,319 INFO L87 Difference]: Start difference. First operand 8408 states and 30952 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:42:40,419 INFO L93 Difference]: Finished difference Result 11096 states and 40883 transitions. [2021-07-13 18:42:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-13 18:42:40,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2021-07-13 18:42:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:42:40,428 INFO L225 Difference]: With dead ends: 11096 [2021-07-13 18:42:40,428 INFO L226 Difference]: Without dead ends: 3579 [2021-07-13 18:42:40,428 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.2ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:42:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2021-07-13 18:42:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 3579. [2021-07-13 18:42:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3579 states, 3578 states have (on average 3.543599776411403) internal successors, (12679), 3578 states have internal predecessors, (12679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 12679 transitions. [2021-07-13 18:42:40,480 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 12679 transitions. Word has length 98 [2021-07-13 18:42:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:42:40,480 INFO L482 AbstractCegarLoop]: Abstraction has 3579 states and 12679 transitions. [2021-07-13 18:42:40,480 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:42:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 12679 transitions. [2021-07-13 18:42:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-07-13 18:42:40,485 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:42:40,485 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:42:40,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-07-13 18:42:40,485 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:42:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:42:40,485 INFO L82 PathProgramCache]: Analyzing trace with hash 754618250, now seen corresponding path program 2 times [2021-07-13 18:42:40,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:42:40,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620910115] [2021-07-13 18:42:40,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:42:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:42:40,508 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:42:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:42:40,540 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:42:40,574 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-13 18:42:40,574 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-13 18:42:40,575 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-07-13 18:42:40,575 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-13 18:42:40,576 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-13 18:42:40,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:42:40 BasicIcfg [2021-07-13 18:42:40,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-13 18:42:40,687 INFO L168 Benchmark]: Toolchain (without parser) took 90415.05 ms. Allocated memory was 228.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 191.2 MB in the beginning and 5.1 GB in the end (delta: -4.9 GB). Peak memory consumption was 2.9 GB. Max. memory is 8.0 GB. [2021-07-13 18:42:40,687 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 228.6 MB. Free memory is still 209.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-13 18:42:40,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.70 ms. Allocated memory is still 228.6 MB. Free memory was 191.1 MB in the beginning and 199.2 MB in the end (delta: -8.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-07-13 18:42:40,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.45 ms. Allocated memory is still 228.6 MB. Free memory was 199.2 MB in the beginning and 196.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:42:40,687 INFO L168 Benchmark]: Boogie Preprocessor took 33.64 ms. Allocated memory is still 228.6 MB. Free memory was 196.0 MB in the beginning and 193.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:42:40,687 INFO L168 Benchmark]: RCFGBuilder took 1675.05 ms. Allocated memory is still 228.6 MB. Free memory was 193.4 MB in the beginning and 88.1 MB in the end (delta: 105.3 MB). Peak memory consumption was 119.4 MB. Max. memory is 8.0 GB. [2021-07-13 18:42:40,687 INFO L168 Benchmark]: TraceAbstraction took 88222.06 ms. Allocated memory was 228.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 87.6 MB in the beginning and 5.1 GB in the end (delta: -5.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 8.0 GB. [2021-07-13 18:42:40,687 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.14 ms. Allocated memory is still 228.6 MB. Free memory is still 209.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 436.70 ms. Allocated memory is still 228.6 MB. Free memory was 191.1 MB in the beginning and 199.2 MB in the end (delta: -8.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 40.45 ms. Allocated memory is still 228.6 MB. Free memory was 199.2 MB in the beginning and 196.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.64 ms. Allocated memory is still 228.6 MB. Free memory was 196.0 MB in the beginning and 193.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1675.05 ms. Allocated memory is still 228.6 MB. Free memory was 193.4 MB in the beginning and 88.1 MB in the end (delta: 105.3 MB). Peak memory consumption was 119.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 88222.06 ms. Allocated memory was 228.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 87.6 MB in the beginning and 5.1 GB in the end (delta: -5.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] 0 pthread_t t821; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t821, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t822; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t822, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t823; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t823, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t824; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t824, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 x = 2 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L766] 2 y = 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork2 with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2312.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 236.7ms, AutomataDifference: 583.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1219.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 109 SDtfs, 51 SDslu, 30 SDs, 0 SdLazy, 4 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=45508occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5.5ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7.8ms SsaConstructionTime, 61.4ms SatisfiabilityAnalysisTime, 117.6ms InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 85680.8ms, OverallIterations: 26, TraceHistogramMax: 1, EmptinessCheckTime: 3334.2ms, AutomataDifference: 30486.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1488.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4691 SDtfs, 7883 SDslu, 20127 SDs, 0 SdLazy, 2369 SolverSat, 499 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2305.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 4109.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=76588occurred in iteration=0, InterpolantAutomatonStates: 300, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 46434.7ms AutomataMinimizationTime, 25 MinimizatonAttempts, 42318 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 87.5ms SsaConstructionTime, 508.1ms SatisfiabilityAnalysisTime, 3081.5ms InterpolantComputationTime, 2255 NumberOfCodeBlocks, 2255 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2132 ConstructedInterpolants, 0 QuantifiedInterpolants, 13747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...