/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/safe030_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9b7772ad7705253c1305067fc38dc9bc7271fbe3-9b7772a [2021-04-15 01:04:58,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-15 01:04:58,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-15 01:04:58,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-15 01:04:58,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-15 01:04:58,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-15 01:04:58,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-15 01:04:58,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-15 01:04:58,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-15 01:04:58,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-15 01:04:58,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-15 01:04:58,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-15 01:04:58,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-15 01:04:58,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-15 01:04:58,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-15 01:04:58,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-15 01:04:58,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-15 01:04:58,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-15 01:04:58,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-15 01:04:58,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-15 01:04:58,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-15 01:04:58,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-15 01:04:58,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-15 01:04:58,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-15 01:04:58,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-15 01:04:58,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-15 01:04:58,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-15 01:04:58,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-15 01:04:58,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-15 01:04:58,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-15 01:04:58,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-15 01:04:58,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-15 01:04:58,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-15 01:04:58,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-15 01:04:58,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-15 01:04:58,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-15 01:04:58,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-15 01:04:58,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-15 01:04:58,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-15 01:04:58,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-15 01:04:58,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-15 01:04:58,902 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 01:04:58,929 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-15 01:04:58,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-15 01:04:58,930 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-04-15 01:04:58,930 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-04-15 01:04:58,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-15 01:04:58,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-15 01:04:58,932 INFO L138 SettingsManager]: * Use SBE=true [2021-04-15 01:04:58,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-15 01:04:58,932 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-15 01:04:58,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-15 01:04:58,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-15 01:04:58,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-15 01:04:58,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-15 01:04:58,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-15 01:04:58,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-15 01:04:58,934 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-15 01:04:58,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-15 01:04:58,934 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-15 01:04:58,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-15 01:04:58,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-15 01:04:58,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-15 01:04:58,934 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-15 01:04:58,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-15 01:04:58,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 01:04:58,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-15 01:04:58,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-15 01:04:58,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-15 01:04:58,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-15 01:04:58,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-15 01:04:58,935 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-04-15 01:04:58,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-15 01:04:58,935 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 01:04:59,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-15 01:04:59,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-15 01:04:59,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-15 01:04:59,206 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-15 01:04:59,207 INFO L275 PluginConnector]: CDTParser initialized [2021-04-15 01:04:59,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i [2021-04-15 01:04:59,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0d53e32/64915e37a65a4d6593fdabaddf601f25/FLAG0833b56fd [2021-04-15 01:04:59,733 INFO L306 CDTParser]: Found 1 translation units. [2021-04-15 01:04:59,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i [2021-04-15 01:04:59,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0d53e32/64915e37a65a4d6593fdabaddf601f25/FLAG0833b56fd [2021-04-15 01:04:59,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0d53e32/64915e37a65a4d6593fdabaddf601f25 [2021-04-15 01:04:59,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-15 01:04:59,764 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-15 01:04:59,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-15 01:04:59,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-15 01:04:59,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-15 01:04:59,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:04:59,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bba45f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59, skipping insertion in model container [2021-04-15 01:04:59,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:04:59,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-15 01:04:59,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-15 01:04:59,944 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/safe030_rmo.oepc.i[950,963] [2021-04-15 01:05:00,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 01:05:00,103 INFO L203 MainTranslator]: Completed pre-run [2021-04-15 01:05:00,113 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/safe030_rmo.oepc.i[950,963] [2021-04-15 01:05:00,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 01:05:00,202 INFO L208 MainTranslator]: Completed translation [2021-04-15 01:05:00,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00 WrapperNode [2021-04-15 01:05:00,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-15 01:05:00,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-15 01:05:00,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-15 01:05:00,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-15 01:05:00,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-15 01:05:00,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-15 01:05:00,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-15 01:05:00,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-15 01:05:00,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-15 01:05:00,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-15 01:05:00,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-15 01:05:00,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-15 01:05:00,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 01:05:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-15 01:05:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-15 01:05:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-15 01:05:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-15 01:05:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-15 01:05:00,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-15 01:05:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-15 01:05:00,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-15 01:05:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-15 01:05:00,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-15 01:05:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-15 01:05:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-15 01:05:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-15 01:05:00,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-15 01:05:00,321 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 01:05:01,654 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-15 01:05:01,655 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-15 01:05:01,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:05:01 BoogieIcfgContainer [2021-04-15 01:05:01,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-15 01:05:01,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-15 01:05:01,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-15 01:05:01,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-15 01:05:01,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:04:59" (1/3) ... [2021-04-15 01:05:01,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc1fcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:05:01, skipping insertion in model container [2021-04-15 01:05:01,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (2/3) ... [2021-04-15 01:05:01,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc1fcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:05:01, skipping insertion in model container [2021-04-15 01:05:01,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:05:01" (3/3) ... [2021-04-15 01:05:01,661 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.oepc.i [2021-04-15 01:05:01,667 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-04-15 01:05:01,667 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-15 01:05:01,670 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-15 01:05:01,671 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-15 01:05:01,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,702 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,708 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,708 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,714 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,714 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,718 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-15 01:05:01,729 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-15 01:05:01,740 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-15 01:05:01,741 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-15 01:05:01,741 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-15 01:05:01,741 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-15 01:05:01,741 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-15 01:05:01,741 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-15 01:05:01,741 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-15 01:05:01,741 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-15 01:05:01,747 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 96 transitions, 207 flow [2021-04-15 01:05:02,303 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15336 states, 15332 states have (on average 3.6506652752413253) internal successors, (55972), 15335 states have internal predecessors, (55972), 0 states have call successors, (0), 0 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 01:05:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 15336 states, 15332 states have (on average 3.6506652752413253) internal successors, (55972), 15335 states have internal predecessors, (55972), 0 states have call successors, (0), 0 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 01:05:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-04-15 01:05:02,334 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:02,335 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] [2021-04-15 01:05:02,335 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:02,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:02,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1089194266, now seen corresponding path program 1 times [2021-04-15 01:05:02,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:02,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413154621] [2021-04-15 01:05:02,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:02,555 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 01:05:02,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413154621] [2021-04-15 01:05:02,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:02,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-15 01:05:02,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171505774] [2021-04-15 01:05:02,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 01:05:02,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:02,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 01:05:02,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 01:05:02,594 INFO L87 Difference]: Start difference. First operand has 15336 states, 15332 states have (on average 3.6506652752413253) internal successors, (55972), 15335 states have internal predecessors, (55972), 0 states have call successors, (0), 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 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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 01:05:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:02,880 INFO L93 Difference]: Finished difference Result 13124 states and 46688 transitions. [2021-04-15 01:05:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 01:05:02,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-04-15 01:05:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:02,950 INFO L225 Difference]: With dead ends: 13124 [2021-04-15 01:05:02,950 INFO L226 Difference]: Without dead ends: 7492 [2021-04-15 01:05:02,951 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 01:05:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2021-04-15 01:05:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 7492. [2021-04-15 01:05:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7492 states, 7491 states have (on average 3.5071419036176747) internal successors, (26272), 7491 states have internal predecessors, (26272), 0 states have call successors, (0), 0 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 01:05:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7492 states to 7492 states and 26272 transitions. [2021-04-15 01:05:03,317 INFO L78 Accepts]: Start accepts. Automaton has 7492 states and 26272 transitions. Word has length 38 [2021-04-15 01:05:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:03,317 INFO L480 AbstractCegarLoop]: Abstraction has 7492 states and 26272 transitions. [2021-04-15 01:05:03,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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 01:05:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7492 states and 26272 transitions. [2021-04-15 01:05:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-04-15 01:05:03,333 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:03,333 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] [2021-04-15 01:05:03,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-15 01:05:03,334 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash -948121074, now seen corresponding path program 1 times [2021-04-15 01:05:03,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:03,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448632952] [2021-04-15 01:05:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:03,547 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 01:05:03,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448632952] [2021-04-15 01:05:03,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:03,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:03,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249026744] [2021-04-15 01:05:03,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:03,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:03,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:03,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:03,551 INFO L87 Difference]: Start difference. First operand 7492 states and 26272 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 01:05:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:03,737 INFO L93 Difference]: Finished difference Result 9252 states and 32116 transitions. [2021-04-15 01:05:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-04-15 01:05:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:03,808 INFO L225 Difference]: With dead ends: 9252 [2021-04-15 01:05:03,809 INFO L226 Difference]: Without dead ends: 7204 [2021-04-15 01:05:03,809 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7204 states. [2021-04-15 01:05:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7204 to 7204. [2021-04-15 01:05:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 7203 states have (on average 3.4924337081771486) internal successors, (25156), 7203 states have internal predecessors, (25156), 0 states have call successors, (0), 0 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 01:05:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 25156 transitions. [2021-04-15 01:05:04,056 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 25156 transitions. Word has length 57 [2021-04-15 01:05:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:04,057 INFO L480 AbstractCegarLoop]: Abstraction has 7204 states and 25156 transitions. [2021-04-15 01:05:04,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 01:05:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 25156 transitions. [2021-04-15 01:05:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-04-15 01:05:04,074 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:04,074 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] [2021-04-15 01:05:04,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-15 01:05:04,074 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:04,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1912407697, now seen corresponding path program 1 times [2021-04-15 01:05:04,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:04,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360905372] [2021-04-15 01:05:04,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:04,201 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 01:05:04,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360905372] [2021-04-15 01:05:04,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:04,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:04,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323822973] [2021-04-15 01:05:04,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:04,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:04,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:04,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:04,204 INFO L87 Difference]: Start difference. First operand 7204 states and 25156 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:04,338 INFO L93 Difference]: Finished difference Result 8844 states and 30580 transitions. [2021-04-15 01:05:04,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:04,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-04-15 01:05:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:04,446 INFO L225 Difference]: With dead ends: 8844 [2021-04-15 01:05:04,446 INFO L226 Difference]: Without dead ends: 6988 [2021-04-15 01:05:04,447 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 69.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6988 states. [2021-04-15 01:05:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6988 to 6988. [2021-04-15 01:05:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6988 states, 6987 states have (on average 3.481894947760126) internal successors, (24328), 6987 states have internal predecessors, (24328), 0 states have call successors, (0), 0 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 01:05:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6988 states to 6988 states and 24328 transitions. [2021-04-15 01:05:04,632 INFO L78 Accepts]: Start accepts. Automaton has 6988 states and 24328 transitions. Word has length 59 [2021-04-15 01:05:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:04,634 INFO L480 AbstractCegarLoop]: Abstraction has 6988 states and 24328 transitions. [2021-04-15 01:05:04,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6988 states and 24328 transitions. [2021-04-15 01:05:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-04-15 01:05:04,642 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:04,642 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] [2021-04-15 01:05:04,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-15 01:05:04,642 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1635427807, now seen corresponding path program 1 times [2021-04-15 01:05:04,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:04,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724271287] [2021-04-15 01:05:04,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:04,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 01:05:04,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724271287] [2021-04-15 01:05:04,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:04,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:04,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140683634] [2021-04-15 01:05:04,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:04,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:04,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:04,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:04,815 INFO L87 Difference]: Start difference. First operand 6988 states and 24328 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 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 01:05:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:04,959 INFO L93 Difference]: Finished difference Result 12108 states and 41544 transitions. [2021-04-15 01:05:04,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:04,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-04-15 01:05:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:04,981 INFO L225 Difference]: With dead ends: 12108 [2021-04-15 01:05:04,982 INFO L226 Difference]: Without dead ends: 7948 [2021-04-15 01:05:04,982 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 75.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7948 states. [2021-04-15 01:05:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7948 to 6508. [2021-04-15 01:05:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6508 states, 6507 states have (on average 3.4086368526202553) internal successors, (22180), 6507 states have internal predecessors, (22180), 0 states have call successors, (0), 0 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 01:05:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 22180 transitions. [2021-04-15 01:05:05,205 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 22180 transitions. Word has length 60 [2021-04-15 01:05:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:05,205 INFO L480 AbstractCegarLoop]: Abstraction has 6508 states and 22180 transitions. [2021-04-15 01:05:05,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 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 01:05:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 22180 transitions. [2021-04-15 01:05:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-04-15 01:05:05,214 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:05,214 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] [2021-04-15 01:05:05,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-15 01:05:05,214 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2104627344, now seen corresponding path program 1 times [2021-04-15 01:05:05,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:05,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956702182] [2021-04-15 01:05:05,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:05,418 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 01:05:05,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956702182] [2021-04-15 01:05:05,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:05,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 01:05:05,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627952779] [2021-04-15 01:05:05,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 01:05:05,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:05,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 01:05:05,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:05,420 INFO L87 Difference]: Start difference. First operand 6508 states and 22180 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 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 01:05:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:05,826 INFO L93 Difference]: Finished difference Result 7868 states and 26688 transitions. [2021-04-15 01:05:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-04-15 01:05:05,827 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-04-15 01:05:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:05,846 INFO L225 Difference]: With dead ends: 7868 [2021-04-15 01:05:05,847 INFO L226 Difference]: Without dead ends: 6684 [2021-04-15 01:05:05,847 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 248.2ms TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:05:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6684 states. [2021-04-15 01:05:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6684 to 6436. [2021-04-15 01:05:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6436 states, 6435 states have (on average 3.4038850038850037) internal successors, (21904), 6435 states have internal predecessors, (21904), 0 states have call successors, (0), 0 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 01:05:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6436 states to 6436 states and 21904 transitions. [2021-04-15 01:05:06,055 INFO L78 Accepts]: Start accepts. Automaton has 6436 states and 21904 transitions. Word has length 61 [2021-04-15 01:05:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:06,056 INFO L480 AbstractCegarLoop]: Abstraction has 6436 states and 21904 transitions. [2021-04-15 01:05:06,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 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 01:05:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6436 states and 21904 transitions. [2021-04-15 01:05:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-04-15 01:05:06,065 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:06,065 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] [2021-04-15 01:05:06,065 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-15 01:05:06,065 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:06,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash -77969310, now seen corresponding path program 1 times [2021-04-15 01:05:06,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:06,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540454167] [2021-04-15 01:05:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:06,132 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 01:05:06,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540454167] [2021-04-15 01:05:06,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:06,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:06,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413277022] [2021-04-15 01:05:06,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:06,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:06,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:06,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:06,134 INFO L87 Difference]: Start difference. First operand 6436 states and 21904 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 01:05:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:06,238 INFO L93 Difference]: Finished difference Result 10876 states and 36416 transitions. [2021-04-15 01:05:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:06,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-04-15 01:05:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:06,257 INFO L225 Difference]: With dead ends: 10876 [2021-04-15 01:05:06,257 INFO L226 Difference]: Without dead ends: 7156 [2021-04-15 01:05:06,257 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 64.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7156 states. [2021-04-15 01:05:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7156 to 6076. [2021-04-15 01:05:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6076 states, 6075 states have (on average 3.323127572016461) internal successors, (20188), 6075 states have internal predecessors, (20188), 0 states have call successors, (0), 0 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 01:05:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6076 states to 6076 states and 20188 transitions. [2021-04-15 01:05:06,456 INFO L78 Accepts]: Start accepts. Automaton has 6076 states and 20188 transitions. Word has length 62 [2021-04-15 01:05:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:06,456 INFO L480 AbstractCegarLoop]: Abstraction has 6076 states and 20188 transitions. [2021-04-15 01:05:06,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 01:05:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6076 states and 20188 transitions. [2021-04-15 01:05:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-04-15 01:05:06,466 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:06,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] [2021-04-15 01:05:06,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-15 01:05:06,466 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:06,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:06,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1005091889, now seen corresponding path program 1 times [2021-04-15 01:05:06,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:06,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844291781] [2021-04-15 01:05:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:06,605 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 01:05:06,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844291781] [2021-04-15 01:05:06,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:06,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-15 01:05:06,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156848137] [2021-04-15 01:05:06,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-15 01:05:06,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:06,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-15 01:05:06,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-04-15 01:05:06,608 INFO L87 Difference]: Start difference. First operand 6076 states and 20188 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 01:05:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:06,973 INFO L93 Difference]: Finished difference Result 7140 states and 23694 transitions. [2021-04-15 01:05:06,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:05:06,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-04-15 01:05:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:06,989 INFO L225 Difference]: With dead ends: 7140 [2021-04-15 01:05:06,989 INFO L226 Difference]: Without dead ends: 6148 [2021-04-15 01:05:06,990 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 208.4ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:05:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6148 states. [2021-04-15 01:05:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6148 to 6092. [2021-04-15 01:05:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6092 states, 6091 states have (on average 3.3216220653423085) internal successors, (20232), 6091 states have internal predecessors, (20232), 0 states have call successors, (0), 0 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 01:05:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6092 states to 6092 states and 20232 transitions. [2021-04-15 01:05:07,181 INFO L78 Accepts]: Start accepts. Automaton has 6092 states and 20232 transitions. Word has length 62 [2021-04-15 01:05:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:07,181 INFO L480 AbstractCegarLoop]: Abstraction has 6092 states and 20232 transitions. [2021-04-15 01:05:07,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 01:05:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6092 states and 20232 transitions. [2021-04-15 01:05:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-04-15 01:05:07,190 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:07,190 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] [2021-04-15 01:05:07,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-15 01:05:07,190 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:07,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:07,191 INFO L82 PathProgramCache]: Analyzing trace with hash 119598043, now seen corresponding path program 2 times [2021-04-15 01:05:07,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:07,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775966078] [2021-04-15 01:05:07,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:07,330 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 01:05:07,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775966078] [2021-04-15 01:05:07,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:07,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 01:05:07,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316310444] [2021-04-15 01:05:07,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 01:05:07,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:07,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 01:05:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:07,333 INFO L87 Difference]: Start difference. First operand 6092 states and 20232 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 01:05:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:07,669 INFO L93 Difference]: Finished difference Result 7124 states and 23620 transitions. [2021-04-15 01:05:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-04-15 01:05:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-04-15 01:05:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:07,687 INFO L225 Difference]: With dead ends: 7124 [2021-04-15 01:05:07,687 INFO L226 Difference]: Without dead ends: 6132 [2021-04-15 01:05:07,687 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 205.0ms TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2021-04-15 01:05:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2021-04-15 01:05:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 6116. [2021-04-15 01:05:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6116 states, 6115 states have (on average 3.323630417007359) internal successors, (20324), 6115 states have internal predecessors, (20324), 0 states have call successors, (0), 0 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 01:05:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6116 states to 6116 states and 20324 transitions. [2021-04-15 01:05:07,901 INFO L78 Accepts]: Start accepts. Automaton has 6116 states and 20324 transitions. Word has length 62 [2021-04-15 01:05:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:07,901 INFO L480 AbstractCegarLoop]: Abstraction has 6116 states and 20324 transitions. [2021-04-15 01:05:07,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 01:05:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6116 states and 20324 transitions. [2021-04-15 01:05:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 01:05:07,912 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:07,913 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] [2021-04-15 01:05:07,913 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-15 01:05:07,913 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:07,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1565955762, now seen corresponding path program 1 times [2021-04-15 01:05:07,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:07,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429023621] [2021-04-15 01:05:07,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:08,013 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 01:05:08,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429023621] [2021-04-15 01:05:08,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:08,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-15 01:05:08,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722116766] [2021-04-15 01:05:08,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-15 01:05:08,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:08,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-15 01:05:08,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-04-15 01:05:08,016 INFO L87 Difference]: Start difference. First operand 6116 states and 20324 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 01:05:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:08,202 INFO L93 Difference]: Finished difference Result 6956 states and 23040 transitions. [2021-04-15 01:05:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 01:05:08,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-04-15 01:05:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:08,214 INFO L225 Difference]: With dead ends: 6956 [2021-04-15 01:05:08,214 INFO L226 Difference]: Without dead ends: 6092 [2021-04-15 01:05:08,215 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 98.5ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-04-15 01:05:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6092 states. [2021-04-15 01:05:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6092 to 6092. [2021-04-15 01:05:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6092 states, 6091 states have (on average 3.320965358725989) internal successors, (20228), 6091 states have internal predecessors, (20228), 0 states have call successors, (0), 0 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 01:05:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6092 states to 6092 states and 20228 transitions. [2021-04-15 01:05:08,319 INFO L78 Accepts]: Start accepts. Automaton has 6092 states and 20228 transitions. Word has length 63 [2021-04-15 01:05:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:08,319 INFO L480 AbstractCegarLoop]: Abstraction has 6092 states and 20228 transitions. [2021-04-15 01:05:08,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 01:05:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6092 states and 20228 transitions. [2021-04-15 01:05:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 01:05:08,330 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:08,330 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] [2021-04-15 01:05:08,330 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-15 01:05:08,330 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2029603919, now seen corresponding path program 1 times [2021-04-15 01:05:08,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:08,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620620208] [2021-04-15 01:05:08,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:08,463 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 01:05:08,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620620208] [2021-04-15 01:05:08,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:08,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 01:05:08,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132828687] [2021-04-15 01:05:08,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 01:05:08,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:08,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 01:05:08,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:08,464 INFO L87 Difference]: Start difference. First operand 6092 states and 20228 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 01:05:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:08,764 INFO L93 Difference]: Finished difference Result 7164 states and 23728 transitions. [2021-04-15 01:05:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-15 01:05:08,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-04-15 01:05:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:08,778 INFO L225 Difference]: With dead ends: 7164 [2021-04-15 01:05:08,780 INFO L226 Difference]: Without dead ends: 6396 [2021-04-15 01:05:08,781 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 198.7ms TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-04-15 01:05:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6396 states. [2021-04-15 01:05:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6396 to 6172. [2021-04-15 01:05:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6172 states, 6171 states have (on average 3.310970669259439) internal successors, (20432), 6171 states have internal predecessors, (20432), 0 states have call successors, (0), 0 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 01:05:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 20432 transitions. [2021-04-15 01:05:08,922 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 20432 transitions. Word has length 63 [2021-04-15 01:05:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:08,922 INFO L480 AbstractCegarLoop]: Abstraction has 6172 states and 20432 transitions. [2021-04-15 01:05:08,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 01:05:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 20432 transitions. [2021-04-15 01:05:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 01:05:08,929 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:08,929 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] [2021-04-15 01:05:08,929 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-15 01:05:08,929 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:08,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash 949795437, now seen corresponding path program 2 times [2021-04-15 01:05:08,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:08,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201211055] [2021-04-15 01:05:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:09,102 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 01:05:09,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201211055] [2021-04-15 01:05:09,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:09,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-15 01:05:09,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266009395] [2021-04-15 01:05:09,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-15 01:05:09,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:09,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-15 01:05:09,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-04-15 01:05:09,104 INFO L87 Difference]: Start difference. First operand 6172 states and 20432 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 01:05:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:09,438 INFO L93 Difference]: Finished difference Result 7228 states and 23864 transitions. [2021-04-15 01:05:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-04-15 01:05:09,438 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-04-15 01:05:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:09,451 INFO L225 Difference]: With dead ends: 7228 [2021-04-15 01:05:09,451 INFO L226 Difference]: Without dead ends: 6332 [2021-04-15 01:05:09,451 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 255.3ms TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2021-04-15 01:05:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6332 states. [2021-04-15 01:05:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6332 to 6252. [2021-04-15 01:05:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6252 states, 6251 states have (on average 3.316589345704687) internal successors, (20732), 6251 states have internal predecessors, (20732), 0 states have call successors, (0), 0 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 01:05:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6252 states to 6252 states and 20732 transitions. [2021-04-15 01:05:09,610 INFO L78 Accepts]: Start accepts. Automaton has 6252 states and 20732 transitions. Word has length 63 [2021-04-15 01:05:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:09,611 INFO L480 AbstractCegarLoop]: Abstraction has 6252 states and 20732 transitions. [2021-04-15 01:05:09,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 01:05:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6252 states and 20732 transitions. [2021-04-15 01:05:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 01:05:09,619 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:09,619 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] [2021-04-15 01:05:09,619 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-15 01:05:09,619 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:09,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1170948817, now seen corresponding path program 1 times [2021-04-15 01:05:09,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:09,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145223127] [2021-04-15 01:05:09,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:09,789 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 01:05:09,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145223127] [2021-04-15 01:05:09,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:09,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 01:05:09,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822152794] [2021-04-15 01:05:09,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 01:05:09,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:09,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 01:05:09,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:09,790 INFO L87 Difference]: Start difference. First operand 6252 states and 20732 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 01:05:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:10,058 INFO L93 Difference]: Finished difference Result 10069 states and 32982 transitions. [2021-04-15 01:05:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-15 01:05:10,059 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-04-15 01:05:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:10,076 INFO L225 Difference]: With dead ends: 10069 [2021-04-15 01:05:10,076 INFO L226 Difference]: Without dead ends: 9349 [2021-04-15 01:05:10,077 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 158.6ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-04-15 01:05:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9349 states. [2021-04-15 01:05:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9349 to 6544. [2021-04-15 01:05:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6544 states, 6543 states have (on average 3.287024300779459) internal successors, (21507), 6543 states have internal predecessors, (21507), 0 states have call successors, (0), 0 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 01:05:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6544 states to 6544 states and 21507 transitions. [2021-04-15 01:05:10,222 INFO L78 Accepts]: Start accepts. Automaton has 6544 states and 21507 transitions. Word has length 64 [2021-04-15 01:05:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:10,222 INFO L480 AbstractCegarLoop]: Abstraction has 6544 states and 21507 transitions. [2021-04-15 01:05:10,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 01:05:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6544 states and 21507 transitions. [2021-04-15 01:05:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 01:05:10,231 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:10,231 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] [2021-04-15 01:05:10,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-15 01:05:10,231 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:10,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1999328547, now seen corresponding path program 2 times [2021-04-15 01:05:10,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:10,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699957252] [2021-04-15 01:05:10,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:10,365 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 01:05:10,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699957252] [2021-04-15 01:05:10,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:10,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:10,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873949408] [2021-04-15 01:05:10,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:10,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:10,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:10,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:10,366 INFO L87 Difference]: Start difference. First operand 6544 states and 21507 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 01:05:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:10,664 INFO L93 Difference]: Finished difference Result 7960 states and 26203 transitions. [2021-04-15 01:05:10,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-15 01:05:10,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-04-15 01:05:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:10,683 INFO L225 Difference]: With dead ends: 7960 [2021-04-15 01:05:10,683 INFO L226 Difference]: Without dead ends: 7112 [2021-04-15 01:05:10,683 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 157.8ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-04-15 01:05:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7112 states. [2021-04-15 01:05:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7112 to 6628. [2021-04-15 01:05:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6628 states, 6627 states have (on average 3.316734570695639) internal successors, (21980), 6627 states have internal predecessors, (21980), 0 states have call successors, (0), 0 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 01:05:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6628 states to 6628 states and 21980 transitions. [2021-04-15 01:05:10,829 INFO L78 Accepts]: Start accepts. Automaton has 6628 states and 21980 transitions. Word has length 64 [2021-04-15 01:05:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:10,829 INFO L480 AbstractCegarLoop]: Abstraction has 6628 states and 21980 transitions. [2021-04-15 01:05:10,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 01:05:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 6628 states and 21980 transitions. [2021-04-15 01:05:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 01:05:10,839 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:10,839 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] [2021-04-15 01:05:10,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-15 01:05:10,839 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:10,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:10,839 INFO L82 PathProgramCache]: Analyzing trace with hash -289667373, now seen corresponding path program 3 times [2021-04-15 01:05:10,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:10,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785343170] [2021-04-15 01:05:10,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:10,980 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 01:05:10,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785343170] [2021-04-15 01:05:10,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:10,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:10,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541328400] [2021-04-15 01:05:10,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:10,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:10,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:10,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:10,981 INFO L87 Difference]: Start difference. First operand 6628 states and 21980 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 01:05:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:11,220 INFO L93 Difference]: Finished difference Result 7403 states and 24448 transitions. [2021-04-15 01:05:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:11,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-04-15 01:05:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:11,233 INFO L225 Difference]: With dead ends: 7403 [2021-04-15 01:05:11,233 INFO L226 Difference]: Without dead ends: 6683 [2021-04-15 01:05:11,234 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 142.8ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-04-15 01:05:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2021-04-15 01:05:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 6644. [2021-04-15 01:05:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6644 states, 6643 states have (on average 3.3153695619449044) internal successors, (22024), 6643 states have internal predecessors, (22024), 0 states have call successors, (0), 0 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 01:05:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6644 states to 6644 states and 22024 transitions. [2021-04-15 01:05:11,368 INFO L78 Accepts]: Start accepts. Automaton has 6644 states and 22024 transitions. Word has length 64 [2021-04-15 01:05:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:11,369 INFO L480 AbstractCegarLoop]: Abstraction has 6644 states and 22024 transitions. [2021-04-15 01:05:11,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 01:05:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 6644 states and 22024 transitions. [2021-04-15 01:05:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 01:05:11,378 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:11,378 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] [2021-04-15 01:05:11,378 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-15 01:05:11,378 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1889727407, now seen corresponding path program 4 times [2021-04-15 01:05:11,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:11,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060890399] [2021-04-15 01:05:11,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:11,536 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 01:05:11,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060890399] [2021-04-15 01:05:11,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:11,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 01:05:11,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956173437] [2021-04-15 01:05:11,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 01:05:11,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:11,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 01:05:11,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:11,550 INFO L87 Difference]: Start difference. First operand 6644 states and 22024 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 01:05:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:11,862 INFO L93 Difference]: Finished difference Result 7446 states and 24584 transitions. [2021-04-15 01:05:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-15 01:05:11,862 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-04-15 01:05:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:11,874 INFO L225 Difference]: With dead ends: 7446 [2021-04-15 01:05:11,874 INFO L226 Difference]: Without dead ends: 6694 [2021-04-15 01:05:11,874 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 179.6ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-04-15 01:05:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2021-04-15 01:05:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 6595. [2021-04-15 01:05:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6595 states, 6594 states have (on average 3.3145283591143464) internal successors, (21856), 6594 states have internal predecessors, (21856), 0 states have call successors, (0), 0 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 01:05:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6595 states to 6595 states and 21856 transitions. [2021-04-15 01:05:12,006 INFO L78 Accepts]: Start accepts. Automaton has 6595 states and 21856 transitions. Word has length 64 [2021-04-15 01:05:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:12,006 INFO L480 AbstractCegarLoop]: Abstraction has 6595 states and 21856 transitions. [2021-04-15 01:05:12,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 01:05:12,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6595 states and 21856 transitions. [2021-04-15 01:05:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 01:05:12,016 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:12,016 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] [2021-04-15 01:05:12,016 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-15 01:05:12,016 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:12,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash 215982151, now seen corresponding path program 5 times [2021-04-15 01:05:12,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:12,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896120530] [2021-04-15 01:05:12,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:12,165 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 01:05:12,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896120530] [2021-04-15 01:05:12,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:12,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 01:05:12,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138725001] [2021-04-15 01:05:12,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 01:05:12,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 01:05:12,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:12,168 INFO L87 Difference]: Start difference. First operand 6595 states and 21856 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 01:05:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:12,659 INFO L93 Difference]: Finished difference Result 7907 states and 25921 transitions. [2021-04-15 01:05:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-04-15 01:05:12,660 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-04-15 01:05:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:12,670 INFO L225 Difference]: With dead ends: 7907 [2021-04-15 01:05:12,670 INFO L226 Difference]: Without dead ends: 6067 [2021-04-15 01:05:12,671 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 357.0ms TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-04-15 01:05:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2021-04-15 01:05:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 5860. [2021-04-15 01:05:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5860 states, 5859 states have (on average 3.2619901006997782) internal successors, (19112), 5859 states have internal predecessors, (19112), 0 states have call successors, (0), 0 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 01:05:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5860 states to 5860 states and 19112 transitions. [2021-04-15 01:05:12,777 INFO L78 Accepts]: Start accepts. Automaton has 5860 states and 19112 transitions. Word has length 64 [2021-04-15 01:05:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:12,777 INFO L480 AbstractCegarLoop]: Abstraction has 5860 states and 19112 transitions. [2021-04-15 01:05:12,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 01:05:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5860 states and 19112 transitions. [2021-04-15 01:05:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-04-15 01:05:12,784 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:12,785 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] [2021-04-15 01:05:12,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-15 01:05:12,785 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:12,785 INFO L82 PathProgramCache]: Analyzing trace with hash -447617809, now seen corresponding path program 1 times [2021-04-15 01:05:12,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:12,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305670216] [2021-04-15 01:05:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:12,854 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 01:05:12,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305670216] [2021-04-15 01:05:12,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:12,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:12,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784805261] [2021-04-15 01:05:12,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:12,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:12,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:12,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:12,856 INFO L87 Difference]: Start difference. First operand 5860 states and 19112 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 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 01:05:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:12,946 INFO L93 Difference]: Finished difference Result 7086 states and 22548 transitions. [2021-04-15 01:05:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:12,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-04-15 01:05:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:12,955 INFO L225 Difference]: With dead ends: 7086 [2021-04-15 01:05:12,955 INFO L226 Difference]: Without dead ends: 4942 [2021-04-15 01:05:12,956 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 60.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4942 states. [2021-04-15 01:05:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4942 to 4942. [2021-04-15 01:05:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4942 states, 4941 states have (on average 3.1746609997976116) internal successors, (15686), 4941 states have internal predecessors, (15686), 0 states have call successors, (0), 0 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 01:05:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4942 states and 15686 transitions. [2021-04-15 01:05:13,039 INFO L78 Accepts]: Start accepts. Automaton has 4942 states and 15686 transitions. Word has length 65 [2021-04-15 01:05:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:13,040 INFO L480 AbstractCegarLoop]: Abstraction has 4942 states and 15686 transitions. [2021-04-15 01:05:13,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 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 01:05:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4942 states and 15686 transitions. [2021-04-15 01:05:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-15 01:05:13,045 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:13,046 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 01:05:13,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-15 01:05:13,046 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:13,046 INFO L82 PathProgramCache]: Analyzing trace with hash -126297308, now seen corresponding path program 1 times [2021-04-15 01:05:13,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:13,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559930551] [2021-04-15 01:05:13,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:13,123 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 01:05:13,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559930551] [2021-04-15 01:05:13,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:13,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 01:05:13,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108971333] [2021-04-15 01:05:13,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 01:05:13,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:13,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 01:05:13,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-15 01:05:13,125 INFO L87 Difference]: Start difference. First operand 4942 states and 15686 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 01:05:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:13,243 INFO L93 Difference]: Finished difference Result 4570 states and 14007 transitions. [2021-04-15 01:05:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 01:05:13,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 01:05:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:13,250 INFO L225 Difference]: With dead ends: 4570 [2021-04-15 01:05:13,250 INFO L226 Difference]: Without dead ends: 2942 [2021-04-15 01:05:13,250 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 74.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-04-15 01:05:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2021-04-15 01:05:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2846. [2021-04-15 01:05:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2845 states have (on average 3.0038664323374342) internal successors, (8546), 2845 states have internal predecessors, (8546), 0 states have call successors, (0), 0 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 01:05:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 8546 transitions. [2021-04-15 01:05:13,314 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 8546 transitions. Word has length 66 [2021-04-15 01:05:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:13,315 INFO L480 AbstractCegarLoop]: Abstraction has 2846 states and 8546 transitions. [2021-04-15 01:05:13,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 01:05:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 8546 transitions. [2021-04-15 01:05:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-04-15 01:05:13,318 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:13,318 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] [2021-04-15 01:05:13,318 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-04-15 01:05:13,318 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:13,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:13,318 INFO L82 PathProgramCache]: Analyzing trace with hash -35521137, now seen corresponding path program 1 times [2021-04-15 01:05:13,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:13,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278718434] [2021-04-15 01:05:13,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:13,388 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 01:05:13,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278718434] [2021-04-15 01:05:13,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:13,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-15 01:05:13,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098716402] [2021-04-15 01:05:13,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-15 01:05:13,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:13,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-15 01:05:13,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-15 01:05:13,390 INFO L87 Difference]: Start difference. First operand 2846 states and 8546 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:13,495 INFO L93 Difference]: Finished difference Result 2216 states and 6419 transitions. [2021-04-15 01:05:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 01:05:13,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-04-15 01:05:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:13,497 INFO L225 Difference]: With dead ends: 2216 [2021-04-15 01:05:13,497 INFO L226 Difference]: Without dead ends: 1092 [2021-04-15 01:05:13,497 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 87.3ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-04-15 01:05:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2021-04-15 01:05:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1060. [2021-04-15 01:05:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1059 states have (on average 2.8083097261567516) internal successors, (2974), 1059 states have internal predecessors, (2974), 0 states have call successors, (0), 0 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 01:05:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 2974 transitions. [2021-04-15 01:05:13,510 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 2974 transitions. Word has length 69 [2021-04-15 01:05:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:13,510 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 2974 transitions. [2021-04-15 01:05:13,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 2974 transitions. [2021-04-15 01:05:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 01:05:13,511 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:13,511 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 01:05:13,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-04-15 01:05:13,511 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:13,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:13,511 INFO L82 PathProgramCache]: Analyzing trace with hash -175803705, now seen corresponding path program 1 times [2021-04-15 01:05:13,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:13,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104062121] [2021-04-15 01:05:13,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:13,703 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 01:05:13,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104062121] [2021-04-15 01:05:13,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:13,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 01:05:13,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237966267] [2021-04-15 01:05:13,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 01:05:13,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:13,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 01:05:13,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-04-15 01:05:13,704 INFO L87 Difference]: Start difference. First operand 1060 states and 2974 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 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 01:05:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:13,867 INFO L93 Difference]: Finished difference Result 1570 states and 4476 transitions. [2021-04-15 01:05:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 01:05:13,867 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 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 01:05:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:13,869 INFO L225 Difference]: With dead ends: 1570 [2021-04-15 01:05:13,869 INFO L226 Difference]: Without dead ends: 980 [2021-04-15 01:05:13,869 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 169.3ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-04-15 01:05:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2021-04-15 01:05:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 900. [2021-04-15 01:05:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 2.720800889877642) internal successors, (2446), 899 states have internal predecessors, (2446), 0 states have call successors, (0), 0 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 01:05:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2446 transitions. [2021-04-15 01:05:13,883 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 2446 transitions. Word has length 72 [2021-04-15 01:05:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:13,883 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 2446 transitions. [2021-04-15 01:05:13,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 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 01:05:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2446 transitions. [2021-04-15 01:05:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 01:05:13,884 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:13,884 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 01:05:13,885 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-04-15 01:05:13,885 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:13,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1543561815, now seen corresponding path program 2 times [2021-04-15 01:05:13,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:13,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766973943] [2021-04-15 01:05:13,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:14,252 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 01:05:14,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766973943] [2021-04-15 01:05:14,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:14,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-04-15 01:05:14,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006153012] [2021-04-15 01:05:14,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-04-15 01:05:14,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:14,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-04-15 01:05:14,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-04-15 01:05:14,254 INFO L87 Difference]: Start difference. First operand 900 states and 2446 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 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 01:05:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:14,527 INFO L93 Difference]: Finished difference Result 1854 states and 5246 transitions. [2021-04-15 01:05:14,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:05:14,528 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 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 01:05:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:14,529 INFO L225 Difference]: With dead ends: 1854 [2021-04-15 01:05:14,530 INFO L226 Difference]: Without dead ends: 1232 [2021-04-15 01:05:14,530 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 343.4ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-04-15 01:05:14,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2021-04-15 01:05:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 748. [2021-04-15 01:05:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 2.7228915662650603) internal successors, (2034), 747 states have internal predecessors, (2034), 0 states have call successors, (0), 0 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 01:05:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2034 transitions. [2021-04-15 01:05:14,541 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2034 transitions. Word has length 72 [2021-04-15 01:05:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:14,541 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 2034 transitions. [2021-04-15 01:05:14,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 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 01:05:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2034 transitions. [2021-04-15 01:05:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 01:05:14,542 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:14,542 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 01:05:14,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-04-15 01:05:14,542 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:14,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:14,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1090344665, now seen corresponding path program 3 times [2021-04-15 01:05:14,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:14,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930422865] [2021-04-15 01:05:14,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 01:05:14,568 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 01:05:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 01:05:14,596 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 01:05:14,630 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-15 01:05:14,630 INFO L652 BasicCegarLoop]: Counterexample might be feasible [2021-04-15 01:05:14,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-04-15 01:05:14,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:05:14 BasicIcfg [2021-04-15 01:05:14,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-15 01:05:14,781 INFO L168 Benchmark]: Toolchain (without parser) took 15017.03 ms. Allocated memory was 255.9 MB in the beginning and 3.8 GB in the end (delta: 3.5 GB). Free memory was 234.6 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,783 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 01:05:14,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.22 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.1 MB in the beginning and 294.1 MB in the end (delta: -59.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.11 ms. Allocated memory is still 335.5 MB. Free memory was 294.1 MB in the beginning and 291.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,783 INFO L168 Benchmark]: Boogie Preprocessor took 22.59 ms. Allocated memory is still 335.5 MB. Free memory was 291.3 MB in the beginning and 288.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,783 INFO L168 Benchmark]: RCFGBuilder took 1387.59 ms. Allocated memory is still 335.5 MB. Free memory was 288.7 MB in the beginning and 194.4 MB in the end (delta: 94.4 MB). Peak memory consumption was 97.0 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,783 INFO L168 Benchmark]: TraceAbstraction took 13123.20 ms. Allocated memory was 335.5 MB in the beginning and 3.8 GB in the end (delta: 3.5 GB). Free memory was 193.3 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,784 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 436.22 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.1 MB in the beginning and 294.1 MB in the end (delta: -59.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 42.11 ms. Allocated memory is still 335.5 MB. Free memory was 294.1 MB in the beginning and 291.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 22.59 ms. Allocated memory is still 335.5 MB. Free memory was 291.3 MB in the beginning and 288.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1387.59 ms. Allocated memory is still 335.5 MB. Free memory was 288.7 MB in the beginning and 194.4 MB in the end (delta: 94.4 MB). Peak memory consumption was 97.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13123.20 ms. Allocated memory was 335.5 MB in the beginning and 3.8 GB in the end (delta: 3.5 GB). Free memory was 193.3 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2501; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2501, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2502; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2502, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2503; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2503, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, 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, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, 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, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, 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, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12891.3ms, OverallIterations: 22, TraceHistogramMax: 1, EmptinessCheckTime: 195.6ms, AutomataDifference: 5678.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 561.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2668 SDtfs, 4143 SDslu, 11516 SDs, 0 SdLazy, 2153 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1828.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 3246.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=15336occurred in iteration=0, InterpolantAutomatonStates: 244, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3069.3ms AutomataMinimizationTime, 21 MinimizatonAttempts, 7470 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 99.1ms SsaConstructionTime, 555.7ms SatisfiabilityAnalysisTime, 2431.8ms InterpolantComputationTime, 1386 NumberOfCodeBlocks, 1386 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1293 ConstructedInterpolants, 0 QuantifiedInterpolants, 8336 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...