/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9b7772ad7705253c1305067fc38dc9bc7271fbe3-9b7772a [2021-04-15 00:34:32,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-15 00:34:32,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-15 00:34:33,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-15 00:34:33,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-15 00:34:33,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-15 00:34:33,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-15 00:34:33,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-15 00:34:33,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-15 00:34:33,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-15 00:34:33,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-15 00:34:33,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-15 00:34:33,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-15 00:34:33,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-15 00:34:33,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-15 00:34:33,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-15 00:34:33,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-15 00:34:33,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-15 00:34:33,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-15 00:34:33,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-15 00:34:33,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-15 00:34:33,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-15 00:34:33,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-15 00:34:33,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-15 00:34:33,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-15 00:34:33,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-15 00:34:33,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-15 00:34:33,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-15 00:34:33,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-15 00:34:33,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-15 00:34:33,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-15 00:34:33,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-15 00:34:33,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-15 00:34:33,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-15 00:34:33,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-15 00:34:33,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-15 00:34:33,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-15 00:34:33,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-15 00:34:33,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-15 00:34:33,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-15 00:34:33,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-15 00:34:33,042 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-04-15 00:34:33,072 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-15 00:34:33,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-15 00:34:33,073 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-04-15 00:34:33,073 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-04-15 00:34:33,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-15 00:34:33,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-15 00:34:33,075 INFO L138 SettingsManager]: * Use SBE=true [2021-04-15 00:34:33,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-15 00:34:33,076 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-15 00:34:33,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-15 00:34:33,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-15 00:34:33,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-15 00:34:33,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-15 00:34:33,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-15 00:34:33,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-15 00:34:33,077 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-15 00:34:33,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-15 00:34:33,077 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-15 00:34:33,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-15 00:34:33,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-15 00:34:33,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-15 00:34:33,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-15 00:34:33,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-15 00:34:33,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 00:34:33,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-15 00:34:33,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-15 00:34:33,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-15 00:34:33,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-15 00:34:33,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-15 00:34:33,078 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-04-15 00:34:33,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-15 00:34:33,078 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-04-15 00:34:33,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-15 00:34:33,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-15 00:34:33,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-15 00:34:33,347 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-15 00:34:33,348 INFO L275 PluginConnector]: CDTParser initialized [2021-04-15 00:34:33,348 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-04-15 00:34:33,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42e317fe3/185c1d1fef0e44648297c2b0c608f122/FLAGea6f396d1 [2021-04-15 00:34:34,063 INFO L306 CDTParser]: Found 1 translation units. [2021-04-15 00:34:34,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i [2021-04-15 00:34:34,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42e317fe3/185c1d1fef0e44648297c2b0c608f122/FLAGea6f396d1 [2021-04-15 00:34:34,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42e317fe3/185c1d1fef0e44648297c2b0c608f122 [2021-04-15 00:34:34,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-15 00:34:34,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-15 00:34:34,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-15 00:34:34,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-15 00:34:34,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-15 00:34:34,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129a096c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34, skipping insertion in model container [2021-04-15 00:34:34,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-15 00:34:34,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-15 00:34:34,626 WARN L226 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-04-15 00:34:34,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 00:34:34,755 INFO L203 MainTranslator]: Completed pre-run [2021-04-15 00:34:34,762 WARN L226 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-04-15 00:34:34,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 00:34:34,828 INFO L208 MainTranslator]: Completed translation [2021-04-15 00:34:34,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34 WrapperNode [2021-04-15 00:34:34,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-15 00:34:34,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-15 00:34:34,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-15 00:34:34,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-15 00:34:34,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-15 00:34:34,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-15 00:34:34,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-15 00:34:34,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-15 00:34:34,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (1/1) ... [2021-04-15 00:34:34,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-15 00:34:34,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-15 00:34:34,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-15 00:34:34,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-15 00:34:34,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (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-04-15 00:34:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-15 00:34:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-15 00:34:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-15 00:34:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-15 00:34:34,964 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-15 00:34:34,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-15 00:34:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-15 00:34:34,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-15 00:34:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-15 00:34:34,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-15 00:34:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-04-15 00:34:34,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-04-15 00:34:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-15 00:34:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-15 00:34:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-15 00:34:34,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-15 00:34:34,968 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-15 00:34:36,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-15 00:34:36,466 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-15 00:34:36,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:34:36 BoogieIcfgContainer [2021-04-15 00:34:36,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-15 00:34:36,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-15 00:34:36,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-15 00:34:36,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-15 00:34:36,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:34:34" (1/3) ... [2021-04-15 00:34:36,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeb7bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:34:36, skipping insertion in model container [2021-04-15 00:34:36,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:34:34" (2/3) ... [2021-04-15 00:34:36,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeb7bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:34:36, skipping insertion in model container [2021-04-15 00:34:36,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:34:36" (3/3) ... [2021-04-15 00:34:36,473 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_rmo.opt.i [2021-04-15 00:34:36,480 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-04-15 00:34:36,480 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-15 00:34:36,483 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-15 00:34:36,484 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-15 00:34:36,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,521 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,521 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,530 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,530 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,530 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,530 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,542 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,543 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,543 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,545 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,546 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,546 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,547 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,548 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,548 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:34:36,549 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-15 00:34:36,560 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-04-15 00:34:36,579 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-15 00:34:36,579 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-15 00:34:36,579 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-15 00:34:36,579 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-15 00:34:36,579 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-15 00:34:36,579 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-15 00:34:36,579 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-15 00:34:36,580 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-15 00:34:36,592 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 115 transitions, 250 flow [2021-04-15 00:35:08,033 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 129317 states, 129313 states have (on average 4.526513188929187) internal successors, (585337), 129316 states have internal predecessors, (585337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 129317 states, 129313 states have (on average 4.526513188929187) internal successors, (585337), 129316 states have internal predecessors, (585337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-15 00:35:08,272 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:08,272 INFO L551 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] [2021-04-15 00:35:08,273 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1463451158, now seen corresponding path program 1 times [2021-04-15 00:35:08,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:08,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881140853] [2021-04-15 00:35:08,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:08,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881140853] [2021-04-15 00:35:08,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:08,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-15 00:35:08,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387295029] [2021-04-15 00:35:08,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 00:35:08,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:08,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 00:35:08,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 00:35:08,690 INFO L87 Difference]: Start difference. First operand has 129317 states, 129313 states have (on average 4.526513188929187) internal successors, (585337), 129316 states have internal predecessors, (585337), 0 states have call successors, (0), 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 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:10,050 INFO L93 Difference]: Finished difference Result 110949 states and 492593 transitions. [2021-04-15 00:35:10,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 00:35:10,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-04-15 00:35:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:10,670 INFO L225 Difference]: With dead ends: 110949 [2021-04-15 00:35:10,670 INFO L226 Difference]: Without dead ends: 58533 [2021-04-15 00:35:10,671 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 00:35:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58533 states. [2021-04-15 00:35:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58533 to 58533. [2021-04-15 00:35:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58533 states, 58532 states have (on average 4.389547597895168) internal successors, (256929), 58532 states have internal predecessors, (256929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58533 states to 58533 states and 256929 transitions. [2021-04-15 00:35:13,561 INFO L78 Accepts]: Start accepts. Automaton has 58533 states and 256929 transitions. Word has length 51 [2021-04-15 00:35:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:13,562 INFO L480 AbstractCegarLoop]: Abstraction has 58533 states and 256929 transitions. [2021-04-15 00:35:13,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 58533 states and 256929 transitions. [2021-04-15 00:35:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-15 00:35:13,608 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:13,608 INFO L551 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] [2021-04-15 00:35:13,608 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-15 00:35:13,609 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:13,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:13,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1498906547, now seen corresponding path program 1 times [2021-04-15 00:35:13,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:13,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291337338] [2021-04-15 00:35:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:13,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291337338] [2021-04-15 00:35:13,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:13,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:35:13,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466755295] [2021-04-15 00:35:13,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:35:13,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:13,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:35:13,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:35:13,817 INFO L87 Difference]: Start difference. First operand 58533 states and 256929 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:14,667 INFO L93 Difference]: Finished difference Result 72645 states and 316205 transitions. [2021-04-15 00:35:14,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:35:14,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-04-15 00:35:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:15,018 INFO L225 Difference]: With dead ends: 72645 [2021-04-15 00:35:15,019 INFO L226 Difference]: Without dead ends: 56517 [2021-04-15 00:35:15,019 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:35:15,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56517 states. [2021-04-15 00:35:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56517 to 56517. [2021-04-15 00:35:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56517 states, 56516 states have (on average 4.3773267747186635) internal successors, (247389), 56516 states have internal predecessors, (247389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56517 states to 56517 states and 247389 transitions. [2021-04-15 00:35:16,978 INFO L78 Accepts]: Start accepts. Automaton has 56517 states and 247389 transitions. Word has length 66 [2021-04-15 00:35:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:16,979 INFO L480 AbstractCegarLoop]: Abstraction has 56517 states and 247389 transitions. [2021-04-15 00:35:16,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 56517 states and 247389 transitions. [2021-04-15 00:35:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-04-15 00:35:17,020 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:17,020 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:17,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-15 00:35:17,020 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:17,021 INFO L82 PathProgramCache]: Analyzing trace with hash -760152684, now seen corresponding path program 1 times [2021-04-15 00:35:17,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:17,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551630952] [2021-04-15 00:35:17,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:17,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551630952] [2021-04-15 00:35:17,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:17,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:35:17,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111175877] [2021-04-15 00:35:17,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:35:17,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:17,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:35:17,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:35:17,187 INFO L87 Difference]: Start difference. First operand 56517 states and 247389 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:17,918 INFO L93 Difference]: Finished difference Result 68925 states and 298973 transitions. [2021-04-15 00:35:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:35:17,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-04-15 00:35:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:18,355 INFO L225 Difference]: With dead ends: 68925 [2021-04-15 00:35:18,355 INFO L226 Difference]: Without dead ends: 54141 [2021-04-15 00:35:18,356 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 80.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:35:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54141 states. [2021-04-15 00:35:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54141 to 54141. [2021-04-15 00:35:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54141 states, 54140 states have (on average 4.361304026597709) internal successors, (236121), 54140 states have internal predecessors, (236121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54141 states to 54141 states and 236121 transitions. [2021-04-15 00:35:20,227 INFO L78 Accepts]: Start accepts. Automaton has 54141 states and 236121 transitions. Word has length 68 [2021-04-15 00:35:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:20,228 INFO L480 AbstractCegarLoop]: Abstraction has 54141 states and 236121 transitions. [2021-04-15 00:35:20,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 54141 states and 236121 transitions. [2021-04-15 00:35:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-04-15 00:35:20,292 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:20,293 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:20,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-15 00:35:20,293 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash 63881639, now seen corresponding path program 1 times [2021-04-15 00:35:20,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:20,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158373971] [2021-04-15 00:35:20,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:20,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158373971] [2021-04-15 00:35:20,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:20,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:35:20,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890486117] [2021-04-15 00:35:20,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:35:20,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:20,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:35:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:35:20,481 INFO L87 Difference]: Start difference. First operand 54141 states and 236121 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:20,900 INFO L93 Difference]: Finished difference Result 61941 states and 267881 transitions. [2021-04-15 00:35:20,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:35:20,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-04-15 00:35:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:21,045 INFO L225 Difference]: With dead ends: 61941 [2021-04-15 00:35:21,046 INFO L226 Difference]: Without dead ends: 48741 [2021-04-15 00:35:21,046 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 77.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:35:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48741 states. [2021-04-15 00:35:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48741 to 48741. [2021-04-15 00:35:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48741 states, 48740 states have (on average 4.342244562987279) internal successors, (211641), 48740 states have internal predecessors, (211641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48741 states to 48741 states and 211641 transitions. [2021-04-15 00:35:22,783 INFO L78 Accepts]: Start accepts. Automaton has 48741 states and 211641 transitions. Word has length 70 [2021-04-15 00:35:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:22,783 INFO L480 AbstractCegarLoop]: Abstraction has 48741 states and 211641 transitions. [2021-04-15 00:35:22,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand 48741 states and 211641 transitions. [2021-04-15 00:35:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-04-15 00:35:22,833 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:22,833 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:22,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-15 00:35:22,833 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:22,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:22,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1253932960, now seen corresponding path program 1 times [2021-04-15 00:35:22,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:22,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729886866] [2021-04-15 00:35:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:22,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729886866] [2021-04-15 00:35:22,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:22,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 00:35:22,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443553014] [2021-04-15 00:35:22,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 00:35:22,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:22,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 00:35:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-15 00:35:22,949 INFO L87 Difference]: Start difference. First operand 48741 states and 211641 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:23,850 INFO L93 Difference]: Finished difference Result 57621 states and 248225 transitions. [2021-04-15 00:35:23,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 00:35:23,851 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-04-15 00:35:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:24,013 INFO L225 Difference]: With dead ends: 57621 [2021-04-15 00:35:24,014 INFO L226 Difference]: Without dead ends: 48021 [2021-04-15 00:35:24,014 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 163.9ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-04-15 00:35:24,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48021 states. [2021-04-15 00:35:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48021 to 48021. [2021-04-15 00:35:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48021 states, 48020 states have (on average 4.335381091211995) internal successors, (208185), 48020 states have internal predecessors, (208185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48021 states to 48021 states and 208185 transitions. [2021-04-15 00:35:25,420 INFO L78 Accepts]: Start accepts. Automaton has 48021 states and 208185 transitions. Word has length 71 [2021-04-15 00:35:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:25,420 INFO L480 AbstractCegarLoop]: Abstraction has 48021 states and 208185 transitions. [2021-04-15 00:35:25,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 48021 states and 208185 transitions. [2021-04-15 00:35:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 00:35:25,475 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:25,475 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:25,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-15 00:35:25,475 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:25,476 INFO L82 PathProgramCache]: Analyzing trace with hash -936835080, now seen corresponding path program 1 times [2021-04-15 00:35:25,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:25,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845253421] [2021-04-15 00:35:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:25,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845253421] [2021-04-15 00:35:25,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:25,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-15 00:35:25,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192871413] [2021-04-15 00:35:25,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-15 00:35:25,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:25,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-15 00:35:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-04-15 00:35:25,588 INFO L87 Difference]: Start difference. First operand 48021 states and 208185 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:26,542 INFO L93 Difference]: Finished difference Result 55819 states and 240671 transitions. [2021-04-15 00:35:26,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-15 00:35:26,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-04-15 00:35:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:26,687 INFO L225 Difference]: With dead ends: 55819 [2021-04-15 00:35:26,687 INFO L226 Difference]: Without dead ends: 48875 [2021-04-15 00:35:26,687 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 180.4ms TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-04-15 00:35:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48875 states. [2021-04-15 00:35:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48875 to 48147. [2021-04-15 00:35:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48147 states, 48146 states have (on average 4.333838740497653) internal successors, (208657), 48146 states have internal predecessors, (208657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48147 states to 48147 states and 208657 transitions. [2021-04-15 00:35:28,099 INFO L78 Accepts]: Start accepts. Automaton has 48147 states and 208657 transitions. Word has length 72 [2021-04-15 00:35:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:28,099 INFO L480 AbstractCegarLoop]: Abstraction has 48147 states and 208657 transitions. [2021-04-15 00:35:28,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 48147 states and 208657 transitions. [2021-04-15 00:35:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 00:35:28,153 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:28,153 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:28,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-15 00:35:28,154 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:28,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:28,154 INFO L82 PathProgramCache]: Analyzing trace with hash 969050294, now seen corresponding path program 2 times [2021-04-15 00:35:28,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:28,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535566606] [2021-04-15 00:35:28,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:28,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535566606] [2021-04-15 00:35:28,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:28,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 00:35:28,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206551573] [2021-04-15 00:35:28,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 00:35:28,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:28,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 00:35:28,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:35:28,296 INFO L87 Difference]: Start difference. First operand 48147 states and 208657 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:29,245 INFO L93 Difference]: Finished difference Result 55707 states and 240057 transitions. [2021-04-15 00:35:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-04-15 00:35:29,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-04-15 00:35:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:29,401 INFO L225 Difference]: With dead ends: 55707 [2021-04-15 00:35:29,401 INFO L226 Difference]: Without dead ends: 48763 [2021-04-15 00:35:29,401 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 177.7ms TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-04-15 00:35:29,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48763 states. [2021-04-15 00:35:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48763 to 48301. [2021-04-15 00:35:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48301 states, 48300 states have (on average 4.334927536231884) internal successors, (209377), 48300 states have internal predecessors, (209377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48301 states to 48301 states and 209377 transitions. [2021-04-15 00:35:30,917 INFO L78 Accepts]: Start accepts. Automaton has 48301 states and 209377 transitions. Word has length 72 [2021-04-15 00:35:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:30,918 INFO L480 AbstractCegarLoop]: Abstraction has 48301 states and 209377 transitions. [2021-04-15 00:35:30,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 48301 states and 209377 transitions. [2021-04-15 00:35:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-04-15 00:35:30,976 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:30,976 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:30,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-15 00:35:30,977 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:30,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:30,977 INFO L82 PathProgramCache]: Analyzing trace with hash -108312607, now seen corresponding path program 1 times [2021-04-15 00:35:30,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:30,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821831309] [2021-04-15 00:35:30,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:31,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821831309] [2021-04-15 00:35:31,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:31,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-04-15 00:35:31,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549781720] [2021-04-15 00:35:31,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-04-15 00:35:31,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:31,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-04-15 00:35:31,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-04-15 00:35:31,199 INFO L87 Difference]: Start difference. First operand 48301 states and 209377 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:32,115 INFO L93 Difference]: Finished difference Result 53261 states and 229145 transitions. [2021-04-15 00:35:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-04-15 00:35:32,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-04-15 00:35:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:32,264 INFO L225 Difference]: With dead ends: 53261 [2021-04-15 00:35:32,264 INFO L226 Difference]: Without dead ends: 46861 [2021-04-15 00:35:32,265 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 249.3ms TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2021-04-15 00:35:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46861 states. [2021-04-15 00:35:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46861 to 46861. [2021-04-15 00:35:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46861 states, 46860 states have (on average 4.328318395219804) internal successors, (202825), 46860 states have internal predecessors, (202825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46861 states to 46861 states and 202825 transitions. [2021-04-15 00:35:33,601 INFO L78 Accepts]: Start accepts. Automaton has 46861 states and 202825 transitions. Word has length 73 [2021-04-15 00:35:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:33,601 INFO L480 AbstractCegarLoop]: Abstraction has 46861 states and 202825 transitions. [2021-04-15 00:35:33,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 46861 states and 202825 transitions. [2021-04-15 00:35:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-04-15 00:35:33,660 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:33,660 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:33,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-15 00:35:33,660 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash 756336097, now seen corresponding path program 1 times [2021-04-15 00:35:33,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:33,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798796697] [2021-04-15 00:35:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:33,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798796697] [2021-04-15 00:35:33,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:33,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 00:35:33,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913733404] [2021-04-15 00:35:33,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 00:35:33,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:33,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 00:35:33,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:35:33,787 INFO L87 Difference]: Start difference. First operand 46861 states and 202825 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:34,647 INFO L93 Difference]: Finished difference Result 54435 states and 234083 transitions. [2021-04-15 00:35:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-15 00:35:34,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-04-15 00:35:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:34,815 INFO L225 Difference]: With dead ends: 54435 [2021-04-15 00:35:34,816 INFO L226 Difference]: Without dead ends: 49059 [2021-04-15 00:35:34,816 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 144.8ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-04-15 00:35:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49059 states. [2021-04-15 00:35:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49059 to 47491. [2021-04-15 00:35:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47491 states, 47490 states have (on average 4.3179406190777) internal successors, (205059), 47490 states have internal predecessors, (205059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47491 states to 47491 states and 205059 transitions. [2021-04-15 00:35:36,404 INFO L78 Accepts]: Start accepts. Automaton has 47491 states and 205059 transitions. Word has length 73 [2021-04-15 00:35:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:36,405 INFO L480 AbstractCegarLoop]: Abstraction has 47491 states and 205059 transitions. [2021-04-15 00:35:36,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 47491 states and 205059 transitions. [2021-04-15 00:35:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-04-15 00:35:36,466 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:36,466 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:36,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-15 00:35:36,466 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:36,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:36,466 INFO L82 PathProgramCache]: Analyzing trace with hash -290759453, now seen corresponding path program 2 times [2021-04-15 00:35:36,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:36,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946057494] [2021-04-15 00:35:36,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:36,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946057494] [2021-04-15 00:35:36,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:36,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-15 00:35:36,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825082832] [2021-04-15 00:35:36,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-15 00:35:36,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:36,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-15 00:35:36,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-04-15 00:35:36,622 INFO L87 Difference]: Start difference. First operand 47491 states and 205059 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:37,169 INFO L93 Difference]: Finished difference Result 54883 states and 235419 transitions. [2021-04-15 00:35:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-04-15 00:35:37,170 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-04-15 00:35:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:37,667 INFO L225 Difference]: With dead ends: 54883 [2021-04-15 00:35:37,667 INFO L226 Difference]: Without dead ends: 48611 [2021-04-15 00:35:37,668 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 228.6ms TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2021-04-15 00:35:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48611 states. [2021-04-15 00:35:38,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48611 to 47981. [2021-04-15 00:35:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47981 states, 47980 states have (on average 4.320821175489788) internal successors, (207313), 47980 states have internal predecessors, (207313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47981 states to 47981 states and 207313 transitions. [2021-04-15 00:35:39,024 INFO L78 Accepts]: Start accepts. Automaton has 47981 states and 207313 transitions. Word has length 73 [2021-04-15 00:35:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:39,024 INFO L480 AbstractCegarLoop]: Abstraction has 47981 states and 207313 transitions. [2021-04-15 00:35:39,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 47981 states and 207313 transitions. [2021-04-15 00:35:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-04-15 00:35:39,090 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:39,090 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:39,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-15 00:35:39,090 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1107284758, now seen corresponding path program 1 times [2021-04-15 00:35:39,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:39,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686067864] [2021-04-15 00:35:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:39,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686067864] [2021-04-15 00:35:39,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:39,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-15 00:35:39,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520882537] [2021-04-15 00:35:39,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-15 00:35:39,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:39,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-15 00:35:39,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-04-15 00:35:39,192 INFO L87 Difference]: Start difference. First operand 47981 states and 207313 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:39,686 INFO L93 Difference]: Finished difference Result 57333 states and 246605 transitions. [2021-04-15 00:35:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 00:35:39,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-04-15 00:35:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:39,850 INFO L225 Difference]: With dead ends: 57333 [2021-04-15 00:35:39,850 INFO L226 Difference]: Without dead ends: 51397 [2021-04-15 00:35:39,851 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 159.7ms TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2021-04-15 00:35:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51397 states. [2021-04-15 00:35:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51397 to 50389. [2021-04-15 00:35:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50389 states, 50388 states have (on average 4.320889894419306) internal successors, (217721), 50388 states have internal predecessors, (217721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50389 states to 50389 states and 217721 transitions. [2021-04-15 00:35:41,899 INFO L78 Accepts]: Start accepts. Automaton has 50389 states and 217721 transitions. Word has length 74 [2021-04-15 00:35:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:41,899 INFO L480 AbstractCegarLoop]: Abstraction has 50389 states and 217721 transitions. [2021-04-15 00:35:41,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 50389 states and 217721 transitions. [2021-04-15 00:35:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-04-15 00:35:42,023 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:42,023 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:42,023 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-15 00:35:42,024 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1872085927, now seen corresponding path program 1 times [2021-04-15 00:35:42,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:42,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607298059] [2021-04-15 00:35:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:42,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607298059] [2021-04-15 00:35:42,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:42,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 00:35:42,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791265282] [2021-04-15 00:35:42,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 00:35:42,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:42,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 00:35:42,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-04-15 00:35:42,178 INFO L87 Difference]: Start difference. First operand 50389 states and 217721 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:42,800 INFO L93 Difference]: Finished difference Result 55051 states and 236515 transitions. [2021-04-15 00:35:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-04-15 00:35:42,801 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-04-15 00:35:42,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:42,959 INFO L225 Difference]: With dead ends: 55051 [2021-04-15 00:35:42,959 INFO L226 Difference]: Without dead ends: 50571 [2021-04-15 00:35:42,959 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 279.8ms TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2021-04-15 00:35:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50571 states. [2021-04-15 00:35:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50571 to 50515. [2021-04-15 00:35:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50515 states, 50514 states have (on average 4.319455992398147) internal successors, (218193), 50514 states have internal predecessors, (218193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50515 states to 50515 states and 218193 transitions. [2021-04-15 00:35:44,411 INFO L78 Accepts]: Start accepts. Automaton has 50515 states and 218193 transitions. Word has length 74 [2021-04-15 00:35:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:44,411 INFO L480 AbstractCegarLoop]: Abstraction has 50515 states and 218193 transitions. [2021-04-15 00:35:44,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 50515 states and 218193 transitions. [2021-04-15 00:35:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-04-15 00:35:44,481 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:44,481 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:44,481 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-15 00:35:44,481 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1124139825, now seen corresponding path program 2 times [2021-04-15 00:35:44,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:44,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639034906] [2021-04-15 00:35:44,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:44,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639034906] [2021-04-15 00:35:44,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:44,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 00:35:44,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899377269] [2021-04-15 00:35:44,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 00:35:44,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 00:35:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-04-15 00:35:44,672 INFO L87 Difference]: Start difference. First operand 50515 states and 218193 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:45,492 INFO L93 Difference]: Finished difference Result 53315 states and 229133 transitions. [2021-04-15 00:35:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-15 00:35:45,493 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-04-15 00:35:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:45,638 INFO L225 Difference]: With dead ends: 53315 [2021-04-15 00:35:45,638 INFO L226 Difference]: Without dead ends: 48835 [2021-04-15 00:35:45,638 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 200.7ms TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-04-15 00:35:45,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48835 states. [2021-04-15 00:35:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48835 to 46917. [2021-04-15 00:35:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46917 states, 46916 states have (on average 4.3211910648819165) internal successors, (202733), 46916 states have internal predecessors, (202733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46917 states to 46917 states and 202733 transitions. [2021-04-15 00:35:46,997 INFO L78 Accepts]: Start accepts. Automaton has 46917 states and 202733 transitions. Word has length 74 [2021-04-15 00:35:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:46,997 INFO L480 AbstractCegarLoop]: Abstraction has 46917 states and 202733 transitions. [2021-04-15 00:35:46,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 46917 states and 202733 transitions. [2021-04-15 00:35:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-04-15 00:35:47,063 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:47,063 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:47,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-15 00:35:47,063 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:47,064 INFO L82 PathProgramCache]: Analyzing trace with hash 52310657, now seen corresponding path program 1 times [2021-04-15 00:35:47,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:47,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681219241] [2021-04-15 00:35:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:47,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681219241] [2021-04-15 00:35:47,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:47,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:35:47,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371517128] [2021-04-15 00:35:47,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:35:47,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:47,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:35:47,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:35:47,119 INFO L87 Difference]: Start difference. First operand 46917 states and 202733 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:47,469 INFO L93 Difference]: Finished difference Result 60217 states and 256665 transitions. [2021-04-15 00:35:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:35:47,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-04-15 00:35:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:48,060 INFO L225 Difference]: With dead ends: 60217 [2021-04-15 00:35:48,060 INFO L226 Difference]: Without dead ends: 42633 [2021-04-15 00:35:48,060 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 54.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:35:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42633 states. [2021-04-15 00:35:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42633 to 42633. [2021-04-15 00:35:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42633 states, 42632 states have (on average 4.252978982923626) internal successors, (181313), 42632 states have internal predecessors, (181313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42633 states to 42633 states and 181313 transitions. [2021-04-15 00:35:48,968 INFO L78 Accepts]: Start accepts. Automaton has 42633 states and 181313 transitions. Word has length 75 [2021-04-15 00:35:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:48,968 INFO L480 AbstractCegarLoop]: Abstraction has 42633 states and 181313 transitions. [2021-04-15 00:35:48,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 42633 states and 181313 transitions. [2021-04-15 00:35:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-04-15 00:35:49,388 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:49,389 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:49,389 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-15 00:35:49,389 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:49,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1982400813, now seen corresponding path program 1 times [2021-04-15 00:35:49,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:49,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687271381] [2021-04-15 00:35:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:49,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-04-15 00:35:49,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687271381] [2021-04-15 00:35:49,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:49,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 00:35:49,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702513204] [2021-04-15 00:35:49,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 00:35:49,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:49,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 00:35:49,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-15 00:35:49,494 INFO L87 Difference]: Start difference. First operand 42633 states and 181313 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:49,859 INFO L93 Difference]: Finished difference Result 45507 states and 188797 transitions. [2021-04-15 00:35:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 00:35:49,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-04-15 00:35:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:49,938 INFO L225 Difference]: With dead ends: 45507 [2021-04-15 00:35:49,938 INFO L226 Difference]: Without dead ends: 30483 [2021-04-15 00:35:49,938 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 126.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-04-15 00:35:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30483 states. [2021-04-15 00:35:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30483 to 30483. [2021-04-15 00:35:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30483 states, 30482 states have (on average 4.088084771340463) internal successors, (124613), 30482 states have internal predecessors, (124613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30483 states to 30483 states and 124613 transitions. [2021-04-15 00:35:50,901 INFO L78 Accepts]: Start accepts. Automaton has 30483 states and 124613 transitions. Word has length 76 [2021-04-15 00:35:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:50,901 INFO L480 AbstractCegarLoop]: Abstraction has 30483 states and 124613 transitions. [2021-04-15 00:35:50,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 30483 states and 124613 transitions. [2021-04-15 00:35:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-04-15 00:35:50,951 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:50,951 INFO L551 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-04-15 00:35:50,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-15 00:35:50,951 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:50,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:50,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1394170044, now seen corresponding path program 1 times [2021-04-15 00:35:50,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:50,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453827599] [2021-04-15 00:35:50,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:51,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453827599] [2021-04-15 00:35:51,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:51,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:35:51,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365673512] [2021-04-15 00:35:51,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:35:51,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:35:51,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:35:51,040 INFO L87 Difference]: Start difference. First operand 30483 states and 124613 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:51,340 INFO L93 Difference]: Finished difference Result 49827 states and 201733 transitions. [2021-04-15 00:35:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:35:51,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-04-15 00:35:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:51,422 INFO L225 Difference]: With dead ends: 49827 [2021-04-15 00:35:51,423 INFO L226 Difference]: Without dead ends: 32211 [2021-04-15 00:35:51,423 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:35:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32211 states. [2021-04-15 00:35:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32211 to 29355. [2021-04-15 00:35:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29355 states, 29354 states have (on average 4.012911357906929) internal successors, (117795), 29354 states have internal predecessors, (117795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29355 states to 29355 states and 117795 transitions. [2021-04-15 00:35:52,399 INFO L78 Accepts]: Start accepts. Automaton has 29355 states and 117795 transitions. Word has length 78 [2021-04-15 00:35:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:52,399 INFO L480 AbstractCegarLoop]: Abstraction has 29355 states and 117795 transitions. [2021-04-15 00:35:52,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 29355 states and 117795 transitions. [2021-04-15 00:35:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-04-15 00:35:52,443 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:52,443 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:35:52,443 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-15 00:35:52,443 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash 487329280, now seen corresponding path program 1 times [2021-04-15 00:35:52,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:52,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938435926] [2021-04-15 00:35:52,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:52,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938435926] [2021-04-15 00:35:52,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:52,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-15 00:35:52,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949834337] [2021-04-15 00:35:52,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-15 00:35:52,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:52,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-15 00:35:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-15 00:35:52,516 INFO L87 Difference]: Start difference. First operand 29355 states and 117795 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:52,762 INFO L93 Difference]: Finished difference Result 25701 states and 100503 transitions. [2021-04-15 00:35:52,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 00:35:52,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-04-15 00:35:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:52,803 INFO L225 Difference]: With dead ends: 25701 [2021-04-15 00:35:52,803 INFO L226 Difference]: Without dead ends: 17205 [2021-04-15 00:35:52,804 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 87.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-04-15 00:35:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17205 states. [2021-04-15 00:35:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17205 to 16757. [2021-04-15 00:35:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16757 states, 16756 states have (on average 3.8330747195034616) internal successors, (64227), 16756 states have internal predecessors, (64227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16757 states to 16757 states and 64227 transitions. [2021-04-15 00:35:53,109 INFO L78 Accepts]: Start accepts. Automaton has 16757 states and 64227 transitions. Word has length 79 [2021-04-15 00:35:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:53,110 INFO L480 AbstractCegarLoop]: Abstraction has 16757 states and 64227 transitions. [2021-04-15 00:35:53,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 16757 states and 64227 transitions. [2021-04-15 00:35:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-04-15 00:35:53,134 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:53,134 INFO L551 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-04-15 00:35:53,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-15 00:35:53,135 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:53,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:53,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1892034137, now seen corresponding path program 1 times [2021-04-15 00:35:53,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:53,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643670539] [2021-04-15 00:35:53,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:53,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643670539] [2021-04-15 00:35:53,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:53,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-15 00:35:53,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351332604] [2021-04-15 00:35:53,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-15 00:35:53,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:53,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-15 00:35:53,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-04-15 00:35:53,342 INFO L87 Difference]: Start difference. First operand 16757 states and 64227 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:54,162 INFO L93 Difference]: Finished difference Result 27155 states and 103330 transitions. [2021-04-15 00:35:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-04-15 00:35:54,162 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-04-15 00:35:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:54,205 INFO L225 Difference]: With dead ends: 27155 [2021-04-15 00:35:54,205 INFO L226 Difference]: Without dead ends: 18877 [2021-04-15 00:35:54,206 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 388.3ms TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2021-04-15 00:35:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18877 states. [2021-04-15 00:35:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18877 to 17407. [2021-04-15 00:35:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17407 states, 17406 states have (on average 3.7900149373779155) internal successors, (65969), 17406 states have internal predecessors, (65969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17407 states to 17407 states and 65969 transitions. [2021-04-15 00:35:54,519 INFO L78 Accepts]: Start accepts. Automaton has 17407 states and 65969 transitions. Word has length 82 [2021-04-15 00:35:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:54,520 INFO L480 AbstractCegarLoop]: Abstraction has 17407 states and 65969 transitions. [2021-04-15 00:35:54,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 17407 states and 65969 transitions. [2021-04-15 00:35:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-04-15 00:35:54,545 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:54,545 INFO L551 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-04-15 00:35:54,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-04-15 00:35:54,545 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:54,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:54,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1092937477, now seen corresponding path program 2 times [2021-04-15 00:35:54,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:54,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192299957] [2021-04-15 00:35:54,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:54,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192299957] [2021-04-15 00:35:54,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:54,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-15 00:35:54,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803522699] [2021-04-15 00:35:54,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-15 00:35:54,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:54,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-15 00:35:54,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-04-15 00:35:54,625 INFO L87 Difference]: Start difference. First operand 17407 states and 65969 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 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-04-15 00:35:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:54,811 INFO L93 Difference]: Finished difference Result 14437 states and 54008 transitions. [2021-04-15 00:35:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-15 00:35:54,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 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-04-15 00:35:54,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:54,827 INFO L225 Difference]: With dead ends: 14437 [2021-04-15 00:35:54,827 INFO L226 Difference]: Without dead ends: 7177 [2021-04-15 00:35:54,827 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 96.3ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-04-15 00:35:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states. [2021-04-15 00:35:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 6297. [2021-04-15 00:35:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6297 states, 6296 states have (on average 3.676143583227446) internal successors, (23145), 6296 states have internal predecessors, (23145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6297 states to 6297 states and 23145 transitions. [2021-04-15 00:35:54,929 INFO L78 Accepts]: Start accepts. Automaton has 6297 states and 23145 transitions. Word has length 82 [2021-04-15 00:35:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:54,929 INFO L480 AbstractCegarLoop]: Abstraction has 6297 states and 23145 transitions. [2021-04-15 00:35:54,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 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-04-15 00:35:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 6297 states and 23145 transitions. [2021-04-15 00:35:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-04-15 00:35:54,938 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:54,938 INFO L551 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-04-15 00:35:54,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-04-15 00:35:54,938 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1844406275, now seen corresponding path program 1 times [2021-04-15 00:35:54,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:54,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881846636] [2021-04-15 00:35:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:35:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:35:55,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881846636] [2021-04-15 00:35:55,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:35:55,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 00:35:55,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396475510] [2021-04-15 00:35:55,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 00:35:55,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:35:55,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 00:35:55,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-04-15 00:35:55,005 INFO L87 Difference]: Start difference. First operand 6297 states and 23145 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 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-04-15 00:35:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:35:55,092 INFO L93 Difference]: Finished difference Result 9267 states and 34183 transitions. [2021-04-15 00:35:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-15 00:35:55,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 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-04-15 00:35:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:35:55,099 INFO L225 Difference]: With dead ends: 9267 [2021-04-15 00:35:55,099 INFO L226 Difference]: Without dead ends: 3549 [2021-04-15 00:35:55,099 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:35:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2021-04-15 00:35:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3549. [2021-04-15 00:35:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3549 states, 3548 states have (on average 3.6293686583990983) internal successors, (12877), 3548 states have internal predecessors, (12877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:35:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 12877 transitions. [2021-04-15 00:35:55,145 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 12877 transitions. Word has length 86 [2021-04-15 00:35:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:35:55,145 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 12877 transitions. [2021-04-15 00:35:55,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 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-04-15 00:35:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 12877 transitions. [2021-04-15 00:35:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-04-15 00:35:55,149 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:35:55,150 INFO L551 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-04-15 00:35:55,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-04-15 00:35:55,150 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:35:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:35:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1980246999, now seen corresponding path program 2 times [2021-04-15 00:35:55,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:35:55,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223652411] [2021-04-15 00:35:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:35:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 00:35:55,174 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 00:35:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 00:35:55,286 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 00:35:55,311 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-15 00:35:55,312 INFO L652 BasicCegarLoop]: Counterexample might be feasible [2021-04-15 00:35:55,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-04-15 00:35:55,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:35:55 BasicIcfg [2021-04-15 00:35:55,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-15 00:35:55,419 INFO L168 Benchmark]: Toolchain (without parser) took 80992.76 ms. Allocated memory was 358.6 MB in the beginning and 15.3 GB in the end (delta: 14.9 GB). Free memory was 321.6 MB in the beginning and 8.6 GB in the end (delta: -8.3 GB). Peak memory consumption was 7.3 GB. Max. memory is 16.0 GB. [2021-04-15 00:35:55,419 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 358.6 MB. Free memory was 340.0 MB in the beginning and 339.9 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 00:35:55,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.28 ms. Allocated memory is still 358.6 MB. Free memory was 321.4 MB in the beginning and 316.1 MB in the end (delta: 5.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-04-15 00:35:55,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.18 ms. Allocated memory is still 358.6 MB. Free memory was 316.1 MB in the beginning and 312.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-04-15 00:35:55,421 INFO L168 Benchmark]: Boogie Preprocessor took 21.31 ms. Allocated memory is still 358.6 MB. Free memory was 312.9 MB in the beginning and 310.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 00:35:55,421 INFO L168 Benchmark]: RCFGBuilder took 1582.63 ms. Allocated memory is still 358.6 MB. Free memory was 310.9 MB in the beginning and 249.5 MB in the end (delta: 61.3 MB). Peak memory consumption was 148.4 MB. Max. memory is 16.0 GB. [2021-04-15 00:35:55,421 INFO L168 Benchmark]: TraceAbstraction took 78949.52 ms. Allocated memory was 358.6 MB in the beginning and 15.3 GB in the end (delta: 14.9 GB). Free memory was 249.5 MB in the beginning and 8.6 GB in the end (delta: -8.3 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB. [2021-04-15 00:35:55,422 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 358.6 MB. Free memory was 340.0 MB in the beginning and 339.9 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 401.28 ms. Allocated memory is still 358.6 MB. Free memory was 321.4 MB in the beginning and 316.1 MB in the end (delta: 5.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 33.18 ms. Allocated memory is still 358.6 MB. Free memory was 316.1 MB in the beginning and 312.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.31 ms. Allocated memory is still 358.6 MB. Free memory was 312.9 MB in the beginning and 310.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1582.63 ms. Allocated memory is still 358.6 MB. Free memory was 310.9 MB in the beginning and 249.5 MB in the end (delta: 61.3 MB). Peak memory consumption was 148.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 78949.52 ms. Allocated memory was 358.6 MB in the beginning and 15.3 GB in the end (delta: 14.9 GB). Free memory was 249.5 MB in the beginning and 8.6 GB in the end (delta: -8.3 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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}, 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] [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}, 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}, 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] [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=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] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __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=0, __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=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] [L763] 2 x = 2 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=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=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=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=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=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] [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=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=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] [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=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=49, 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=49, 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=49, 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 CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 78734.6ms, OverallIterations: 21, TraceHistogramMax: 1, EmptinessCheckTime: 1625.7ms, AutomataDifference: 17153.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 31453.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3319 SDtfs, 5837 SDslu, 13117 SDs, 0 SdLazy, 1727 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1506.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2908.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=129317occurred in iteration=0, InterpolantAutomatonStates: 240, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 25529.2ms AutomataMinimizationTime, 20 MinimizatonAttempts, 12024 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 48.7ms SsaConstructionTime, 586.3ms SatisfiabilityAnalysisTime, 1962.7ms InterpolantComputationTime, 1555 NumberOfCodeBlocks, 1555 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1449 ConstructedInterpolants, 0 QuantifiedInterpolants, 8218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...