/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 11:19:13,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 11:19:13,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 11:19:13,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 11:19:13,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 11:19:13,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 11:19:13,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 11:19:13,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 11:19:13,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 11:19:13,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 11:19:13,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 11:19:13,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 11:19:13,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 11:19:13,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 11:19:13,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 11:19:13,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 11:19:13,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 11:19:13,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 11:19:13,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 11:19:13,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 11:19:13,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 11:19:13,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 11:19:13,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 11:19:13,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 11:19:13,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 11:19:13,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 11:19:13,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 11:19:13,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 11:19:13,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 11:19:13,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 11:19:13,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 11:19:13,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 11:19:13,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 11:19:13,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 11:19:13,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 11:19:13,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 11:19:13,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 11:19:13,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 11:19:13,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 11:19:13,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 11:19:13,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 11:19:13,889 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-SemanticLbe.epf [2021-03-11 11:19:13,913 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 11:19:13,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 11:19:13,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 11:19:13,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 11:19:13,916 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 11:19:13,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 11:19:13,917 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 11:19:13,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 11:19:13,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 11:19:13,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 11:19:13,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 11:19:13,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 11:19:13,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 11:19:13,918 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 11:19:13,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 11:19:13,918 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 11:19:13,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 11:19:13,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 11:19:13,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 11:19:13,920 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 11:19:13,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 11:19:13,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:19:13,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 11:19:13,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 11:19:13,921 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 11:19:13,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 11:19:13,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 11:19:13,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 11:19:13,921 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-03-11 11:19:14,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 11:19:14,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 11:19:14,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 11:19:14,174 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 11:19:14,175 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 11:19:14,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2021-03-11 11:19:14,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74639f1a/cc64c58e95564b31851a0d65e8e88856/FLAG2aefbe00a [2021-03-11 11:19:14,611 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 11:19:14,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2021-03-11 11:19:14,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74639f1a/cc64c58e95564b31851a0d65e8e88856/FLAG2aefbe00a [2021-03-11 11:19:14,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74639f1a/cc64c58e95564b31851a0d65e8e88856 [2021-03-11 11:19:14,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 11:19:14,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 11:19:14,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 11:19:14,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 11:19:14,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 11:19:14,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:14,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e6abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14, skipping insertion in model container [2021-03-11 11:19:14,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:14,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 11:19:14,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 11:19:14,813 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/safe005_pso.opt.i[992,1005] [2021-03-11 11:19:14,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:19:14,904 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 11:19:14,911 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/safe005_pso.opt.i[992,1005] [2021-03-11 11:19:14,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:19:14,984 INFO L208 MainTranslator]: Completed translation [2021-03-11 11:19:14,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14 WrapperNode [2021-03-11 11:19:14,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 11:19:14,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 11:19:14,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 11:19:14,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 11:19:14,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:15,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:15,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 11:19:15,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 11:19:15,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 11:19:15,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 11:19:15,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:15,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:15,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:15,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:15,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:15,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:15,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (1/1) ... [2021-03-11 11:19:15,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 11:19:15,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 11:19:15,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 11:19:15,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 11:19:15,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (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-03-11 11:19:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 11:19:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 11:19:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 11:19:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 11:19:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 11:19:15,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 11:19:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 11:19:15,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 11:19:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 11:19:15,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 11:19:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 11:19:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 11:19:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 11:19:15,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 11:19:15,130 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 11:19:16,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 11:19:16,369 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 11:19:16,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:19:16 BoogieIcfgContainer [2021-03-11 11:19:16,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 11:19:16,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 11:19:16,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 11:19:16,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 11:19:16,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:19:14" (1/3) ... [2021-03-11 11:19:16,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791f6d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:19:16, skipping insertion in model container [2021-03-11 11:19:16,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:19:14" (2/3) ... [2021-03-11 11:19:16,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791f6d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:19:16, skipping insertion in model container [2021-03-11 11:19:16,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:19:16" (3/3) ... [2021-03-11 11:19:16,375 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_pso.opt.i [2021-03-11 11:19:16,380 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 11:19:16,380 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 11:19:16,382 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 11:19:16,383 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 11:19:16,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,405 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,405 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,424 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,425 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,425 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,426 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,426 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:19:16,427 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 11:19:16,438 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 11:19:16,448 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 11:19:16,448 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 11:19:16,448 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 11:19:16,449 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 11:19:16,449 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 11:19:16,449 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 11:19:16,449 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 11:19:16,449 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 11:19:16,456 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 11:19:16,461 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2021-03-11 11:19:16,463 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow [2021-03-11 11:19:16,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 11:19:16,486 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-11 11:19:16,486 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 11:19:16,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-11 11:19:16,490 INFO L116 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-11 11:19:17,450 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 11:19:17,812 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 11:19:17,935 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 11:19:20,336 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-11 11:19:20,453 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 11:19:20,712 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-11 11:19:20,839 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 11:19:20,842 INFO L131 LiptonReduction]: Checked pairs total: 4118 [2021-03-11 11:19:20,842 INFO L133 LiptonReduction]: Total number of compositions: 82 [2021-03-11 11:19:20,846 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2021-03-11 11:19:20,872 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 778 states, 774 states have (on average 3.3281653746770026) internal successors, (2576), 777 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 778 states, 774 states have (on average 3.3281653746770026) internal successors, (2576), 777 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-03-11 11:19:20,883 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:20,884 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 11:19:20,884 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:20,892 INFO L82 PathProgramCache]: Analyzing trace with hash 928798552, now seen corresponding path program 1 times [2021-03-11 11:19:20,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:20,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827991840] [2021-03-11 11:19:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:21,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:21,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827991840] [2021-03-11 11:19:21,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:21,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:19:21,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721917195] [2021-03-11 11:19:21,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:19:21,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:21,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:19:21,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:19:21,088 INFO L87 Difference]: Start difference. First operand has 778 states, 774 states have (on average 3.3281653746770026) internal successors, (2576), 777 states have internal predecessors, (2576), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:21,164 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2021-03-11 11:19:21,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:19:21,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-03-11 11:19:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:21,181 INFO L225 Difference]: With dead ends: 650 [2021-03-11 11:19:21,181 INFO L226 Difference]: Without dead ends: 550 [2021-03-11 11:19:21,182 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:19:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-03-11 11:19:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2021-03-11 11:19:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.083788706739526) internal successors, (1693), 549 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2021-03-11 11:19:21,249 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 5 [2021-03-11 11:19:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:21,249 INFO L480 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2021-03-11 11:19:21,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2021-03-11 11:19:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-03-11 11:19:21,251 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:21,251 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:21,251 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 11:19:21,251 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1889707122, now seen corresponding path program 1 times [2021-03-11 11:19:21,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:21,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943958923] [2021-03-11 11:19:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:21,344 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 11:19:21,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:19:21,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:21,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943958923] [2021-03-11 11:19:21,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:21,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:19:21,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381511370] [2021-03-11 11:19:21,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:19:21,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:19:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:19:21,356 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:21,410 INFO L93 Difference]: Finished difference Result 1032 states and 3015 transitions. [2021-03-11 11:19:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:19:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-03-11 11:19:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:21,413 INFO L225 Difference]: With dead ends: 1032 [2021-03-11 11:19:21,413 INFO L226 Difference]: Without dead ends: 713 [2021-03-11 11:19:21,413 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:19:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-03-11 11:19:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 575. [2021-03-11 11:19:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 2.8885017421602788) internal successors, (1658), 574 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1658 transitions. [2021-03-11 11:19:21,442 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1658 transitions. Word has length 10 [2021-03-11 11:19:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:21,443 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 1658 transitions. [2021-03-11 11:19:21,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1658 transitions. [2021-03-11 11:19:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-03-11 11:19:21,444 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:21,444 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:21,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 11:19:21,444 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:21,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:21,445 INFO L82 PathProgramCache]: Analyzing trace with hash 848395264, now seen corresponding path program 1 times [2021-03-11 11:19:21,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:21,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068878372] [2021-03-11 11:19:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:21,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,507 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 11:19:21,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:19:21,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:21,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068878372] [2021-03-11 11:19:21,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:21,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:19:21,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755237307] [2021-03-11 11:19:21,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:19:21,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:19:21,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:19:21,521 INFO L87 Difference]: Start difference. First operand 575 states and 1658 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:21,572 INFO L93 Difference]: Finished difference Result 768 states and 2109 transitions. [2021-03-11 11:19:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:19:21,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-03-11 11:19:21,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:21,575 INFO L225 Difference]: With dead ends: 768 [2021-03-11 11:19:21,575 INFO L226 Difference]: Without dead ends: 599 [2021-03-11 11:19:21,575 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:19:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-03-11 11:19:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 476. [2021-03-11 11:19:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 2.905263157894737) internal successors, (1380), 475 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1380 transitions. [2021-03-11 11:19:21,588 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1380 transitions. Word has length 11 [2021-03-11 11:19:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:21,588 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 1380 transitions. [2021-03-11 11:19:21,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1380 transitions. [2021-03-11 11:19:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 11:19:21,592 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:21,592 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:21,594 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 11:19:21,594 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:21,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1785983794, now seen corresponding path program 1 times [2021-03-11 11:19:21,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:21,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408757160] [2021-03-11 11:19:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:21,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,684 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 11:19:21,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:19:21,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:21,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408757160] [2021-03-11 11:19:21,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:21,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:19:21,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172626095] [2021-03-11 11:19:21,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:19:21,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:19:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:19:21,704 INFO L87 Difference]: Start difference. First operand 476 states and 1380 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:21,749 INFO L93 Difference]: Finished difference Result 856 states and 2409 transitions. [2021-03-11 11:19:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:19:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-03-11 11:19:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:21,751 INFO L225 Difference]: With dead ends: 856 [2021-03-11 11:19:21,751 INFO L226 Difference]: Without dead ends: 502 [2021-03-11 11:19:21,751 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.7ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:19:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-03-11 11:19:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 412. [2021-03-11 11:19:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.798053527980535) internal successors, (1150), 411 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1150 transitions. [2021-03-11 11:19:21,760 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1150 transitions. Word has length 12 [2021-03-11 11:19:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:21,760 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 1150 transitions. [2021-03-11 11:19:21,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1150 transitions. [2021-03-11 11:19:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 11:19:21,762 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:21,762 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:21,762 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 11:19:21,762 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1814710624, now seen corresponding path program 1 times [2021-03-11 11:19:21,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:21,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220702845] [2021-03-11 11:19:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:21,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:19:21,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,848 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 11:19:21,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:19:21,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:21,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220702845] [2021-03-11 11:19:21,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:21,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:19:21,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073880729] [2021-03-11 11:19:21,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:19:21,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:19:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:19:21,865 INFO L87 Difference]: Start difference. First operand 412 states and 1150 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:21,942 INFO L93 Difference]: Finished difference Result 912 states and 2435 transitions. [2021-03-11 11:19:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 11:19:21,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-03-11 11:19:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:21,944 INFO L225 Difference]: With dead ends: 912 [2021-03-11 11:19:21,944 INFO L226 Difference]: Without dead ends: 545 [2021-03-11 11:19:21,945 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 42.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:19:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-03-11 11:19:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 308. [2021-03-11 11:19:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.732899022801303) internal successors, (839), 307 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 839 transitions. [2021-03-11 11:19:21,951 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 839 transitions. Word has length 13 [2021-03-11 11:19:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:21,951 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 839 transitions. [2021-03-11 11:19:21,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 839 transitions. [2021-03-11 11:19:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-03-11 11:19:21,952 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:21,952 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:21,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 11:19:21,952 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:21,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1809586787, now seen corresponding path program 1 times [2021-03-11 11:19:21,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:21,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380510518] [2021-03-11 11:19:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:21,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:21,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:21,995 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 11:19:21,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:19:22,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:22,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380510518] [2021-03-11 11:19:22,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:22,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:19:22,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485215236] [2021-03-11 11:19:22,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:19:22,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:22,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:19:22,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:19:22,011 INFO L87 Difference]: Start difference. First operand 308 states and 839 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:22,038 INFO L93 Difference]: Finished difference Result 344 states and 896 transitions. [2021-03-11 11:19:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:19:22,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-03-11 11:19:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:22,039 INFO L225 Difference]: With dead ends: 344 [2021-03-11 11:19:22,039 INFO L226 Difference]: Without dead ends: 272 [2021-03-11 11:19:22,039 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:19:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-03-11 11:19:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 263. [2021-03-11 11:19:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 2.698473282442748) internal successors, (707), 262 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 707 transitions. [2021-03-11 11:19:22,044 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 707 transitions. Word has length 14 [2021-03-11 11:19:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:22,044 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 707 transitions. [2021-03-11 11:19:22,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 707 transitions. [2021-03-11 11:19:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:19:22,045 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:22,045 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:22,045 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 11:19:22,045 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:22,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:22,045 INFO L82 PathProgramCache]: Analyzing trace with hash 261263643, now seen corresponding path program 1 times [2021-03-11 11:19:22,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:22,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940663301] [2021-03-11 11:19:22,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:22,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,088 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:19:22,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:19:22,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:19:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:22,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940663301] [2021-03-11 11:19:22,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:22,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:19:22,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49072432] [2021-03-11 11:19:22,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:19:22,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:22,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:19:22,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:19:22,096 INFO L87 Difference]: Start difference. First operand 263 states and 707 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:22,115 INFO L93 Difference]: Finished difference Result 252 states and 596 transitions. [2021-03-11 11:19:22,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:19:22,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-03-11 11:19:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:22,116 INFO L225 Difference]: With dead ends: 252 [2021-03-11 11:19:22,116 INFO L226 Difference]: Without dead ends: 191 [2021-03-11 11:19:22,116 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:19:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-03-11 11:19:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-03-11 11:19:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.331578947368421) internal successors, (443), 190 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 443 transitions. [2021-03-11 11:19:22,120 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 443 transitions. Word has length 15 [2021-03-11 11:19:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:22,120 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 443 transitions. [2021-03-11 11:19:22,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 443 transitions. [2021-03-11 11:19:22,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:19:22,121 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:22,121 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:22,121 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 11:19:22,121 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash 319490642, now seen corresponding path program 1 times [2021-03-11 11:19:22,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:22,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988281285] [2021-03-11 11:19:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:22,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:19:22,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,190 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 11:19:22,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:19:22,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:22,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988281285] [2021-03-11 11:19:22,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:22,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:19:22,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336738196] [2021-03-11 11:19:22,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:19:22,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:22,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:19:22,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:19:22,206 INFO L87 Difference]: Start difference. First operand 191 states and 443 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:22,227 INFO L93 Difference]: Finished difference Result 275 states and 639 transitions. [2021-03-11 11:19:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:19:22,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-03-11 11:19:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:22,228 INFO L225 Difference]: With dead ends: 275 [2021-03-11 11:19:22,228 INFO L226 Difference]: Without dead ends: 172 [2021-03-11 11:19:22,228 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:19:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-03-11 11:19:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-03-11 11:19:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.3625730994152048) internal successors, (404), 171 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 404 transitions. [2021-03-11 11:19:22,233 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 404 transitions. Word has length 17 [2021-03-11 11:19:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:22,233 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 404 transitions. [2021-03-11 11:19:22,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 404 transitions. [2021-03-11 11:19:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:19:22,233 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:22,234 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:22,234 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 11:19:22,234 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:22,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1728867380, now seen corresponding path program 1 times [2021-03-11 11:19:22,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:22,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517871668] [2021-03-11 11:19:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:22,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,271 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:19:22,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:19:22,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:19:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:22,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517871668] [2021-03-11 11:19:22,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:22,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:19:22,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790393424] [2021-03-11 11:19:22,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:19:22,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:22,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:19:22,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:19:22,279 INFO L87 Difference]: Start difference. First operand 172 states and 404 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:22,302 INFO L93 Difference]: Finished difference Result 134 states and 273 transitions. [2021-03-11 11:19:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:19:22,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-03-11 11:19:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:22,303 INFO L225 Difference]: With dead ends: 134 [2021-03-11 11:19:22,303 INFO L226 Difference]: Without dead ends: 102 [2021-03-11 11:19:22,305 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:19:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-03-11 11:19:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-03-11 11:19:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.9603960396039604) internal successors, (198), 101 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 198 transitions. [2021-03-11 11:19:22,308 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 198 transitions. Word has length 17 [2021-03-11 11:19:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:22,308 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 198 transitions. [2021-03-11 11:19:22,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 198 transitions. [2021-03-11 11:19:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:19:22,308 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:22,308 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:22,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 11:19:22,309 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:22,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1945185755, now seen corresponding path program 1 times [2021-03-11 11:19:22,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:22,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597189550] [2021-03-11 11:19:22,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:22,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:19:22,376 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-11 11:19:22,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 11:19:22,388 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-11 11:19:22,389 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-11 11:19:22,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:22,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597189550] [2021-03-11 11:19:22,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:22,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:19:22,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985104188] [2021-03-11 11:19:22,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:19:22,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:22,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:19:22,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:19:22,413 INFO L87 Difference]: Start difference. First operand 102 states and 198 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:22,479 INFO L93 Difference]: Finished difference Result 129 states and 245 transitions. [2021-03-11 11:19:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:19:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-03-11 11:19:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:22,480 INFO L225 Difference]: With dead ends: 129 [2021-03-11 11:19:22,480 INFO L226 Difference]: Without dead ends: 102 [2021-03-11 11:19:22,480 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 41.9ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:19:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-03-11 11:19:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-03-11 11:19:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.9207920792079207) internal successors, (194), 101 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 194 transitions. [2021-03-11 11:19:22,482 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 194 transitions. Word has length 19 [2021-03-11 11:19:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:22,482 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 194 transitions. [2021-03-11 11:19:22,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 194 transitions. [2021-03-11 11:19:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:19:22,483 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:22,483 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:22,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 11:19:22,483 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2082430218, now seen corresponding path program 1 times [2021-03-11 11:19:22,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:22,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819210814] [2021-03-11 11:19:22,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:22,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,520 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:19:22,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:19:22,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:19:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:22,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819210814] [2021-03-11 11:19:22,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:22,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:19:22,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065608167] [2021-03-11 11:19:22,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:19:22,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:22,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:19:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:19:22,527 INFO L87 Difference]: Start difference. First operand 102 states and 194 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:22,556 INFO L93 Difference]: Finished difference Result 83 states and 154 transitions. [2021-03-11 11:19:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:19:22,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-03-11 11:19:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:22,557 INFO L225 Difference]: With dead ends: 83 [2021-03-11 11:19:22,557 INFO L226 Difference]: Without dead ends: 74 [2021-03-11 11:19:22,557 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.1ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:19:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-03-11 11:19:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2021-03-11 11:19:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.859375) internal successors, (119), 64 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 119 transitions. [2021-03-11 11:19:22,558 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 119 transitions. Word has length 19 [2021-03-11 11:19:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:22,558 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 119 transitions. [2021-03-11 11:19:22,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 119 transitions. [2021-03-11 11:19:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-11 11:19:22,559 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:22,559 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:22,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 11:19:22,559 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:22,559 INFO L82 PathProgramCache]: Analyzing trace with hash 14569409, now seen corresponding path program 1 times [2021-03-11 11:19:22,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:22,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680460617] [2021-03-11 11:19:22,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:22,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:19:22,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,603 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 11:19:22,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:19:22,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:22,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680460617] [2021-03-11 11:19:22,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:22,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:19:22,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677777078] [2021-03-11 11:19:22,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:19:22,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:22,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:19:22,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:19:22,615 INFO L87 Difference]: Start difference. First operand 65 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:22,659 INFO L93 Difference]: Finished difference Result 95 states and 174 transitions. [2021-03-11 11:19:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:19:22,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-03-11 11:19:22,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:22,662 INFO L225 Difference]: With dead ends: 95 [2021-03-11 11:19:22,662 INFO L226 Difference]: Without dead ends: 62 [2021-03-11 11:19:22,662 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:19:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-03-11 11:19:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-03-11 11:19:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 111 transitions. [2021-03-11 11:19:22,663 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 111 transitions. Word has length 21 [2021-03-11 11:19:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:22,663 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 111 transitions. [2021-03-11 11:19:22,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 111 transitions. [2021-03-11 11:19:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-11 11:19:22,664 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:22,664 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:22,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 11:19:22,664 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:22,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:22,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1074270627, now seen corresponding path program 2 times [2021-03-11 11:19:22,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:22,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145836917] [2021-03-11 11:19:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:19:22,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:19:22,728 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.7 percent of original size [2021-03-11 11:19:22,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-11 11:19:22,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:19:22,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:19:22,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:19:22,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:19:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:19:22,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145836917] [2021-03-11 11:19:22,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:19:22,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:19:22,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418667228] [2021-03-11 11:19:22,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 11:19:22,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:19:22,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 11:19:22,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:19:22,774 INFO L87 Difference]: Start difference. First operand 62 states and 111 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:19:22,841 INFO L93 Difference]: Finished difference Result 73 states and 126 transitions. [2021-03-11 11:19:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:19:22,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-03-11 11:19:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:19:22,842 INFO L225 Difference]: With dead ends: 73 [2021-03-11 11:19:22,842 INFO L226 Difference]: Without dead ends: 42 [2021-03-11 11:19:22,842 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 64.4ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-03-11 11:19:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-03-11 11:19:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-03-11 11:19:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 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-03-11 11:19:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2021-03-11 11:19:22,843 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 21 [2021-03-11 11:19:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:19:22,843 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 65 transitions. [2021-03-11 11:19:22,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:19:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2021-03-11 11:19:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-11 11:19:22,844 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:19:22,844 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:19:22,844 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 11:19:22,844 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:19:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:19:22,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1159081721, now seen corresponding path program 3 times [2021-03-11 11:19:22,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:19:22,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133788587] [2021-03-11 11:19:22,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:19:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:19:22,871 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:19:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:19:22,910 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:19:22,938 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 11:19:22,938 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 11:19:22,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 11:19:22,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:19:22 BasicIcfg [2021-03-11 11:19:22,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 11:19:22,987 INFO L168 Benchmark]: Toolchain (without parser) took 8347.34 ms. Allocated memory was 350.2 MB in the beginning and 536.9 MB in the end (delta: 186.6 MB). Free memory was 313.3 MB in the beginning and 419.9 MB in the end (delta: -106.7 MB). Peak memory consumption was 81.7 MB. Max. memory is 16.0 GB. [2021-03-11 11:19:22,987 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 350.2 MB. Free memory was 331.4 MB in the beginning and 331.4 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 11:19:22,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.04 ms. Allocated memory is still 350.2 MB. Free memory was 312.7 MB in the beginning and 308.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:19:22,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.20 ms. Allocated memory is still 350.2 MB. Free memory was 308.8 MB in the beginning and 306.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:19:22,987 INFO L168 Benchmark]: Boogie Preprocessor took 31.11 ms. Allocated memory is still 350.2 MB. Free memory was 306.7 MB in the beginning and 304.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:19:22,988 INFO L168 Benchmark]: RCFGBuilder took 1295.57 ms. Allocated memory is still 350.2 MB. Free memory was 304.6 MB in the beginning and 242.9 MB in the end (delta: 61.7 MB). Peak memory consumption was 126.7 MB. Max. memory is 16.0 GB. [2021-03-11 11:19:22,988 INFO L168 Benchmark]: TraceAbstraction took 6614.69 ms. Allocated memory was 350.2 MB in the beginning and 536.9 MB in the end (delta: 186.6 MB). Free memory was 242.9 MB in the beginning and 419.9 MB in the end (delta: -177.0 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.0 GB. [2021-03-11 11:19:22,989 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 350.2 MB. Free memory was 331.4 MB in the beginning and 331.4 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 342.04 ms. Allocated memory is still 350.2 MB. Free memory was 312.7 MB in the beginning and 308.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.20 ms. Allocated memory is still 350.2 MB. Free memory was 308.8 MB in the beginning and 306.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.11 ms. Allocated memory is still 350.2 MB. Free memory was 306.7 MB in the beginning and 304.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1295.57 ms. Allocated memory is still 350.2 MB. Free memory was 304.6 MB in the beginning and 242.9 MB in the end (delta: 61.7 MB). Peak memory consumption was 126.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6614.69 ms. Allocated memory was 350.2 MB in the beginning and 536.9 MB in the end (delta: 186.6 MB). Free memory was 242.9 MB in the beginning and 419.9 MB in the end (delta: -177.0 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4379.2ms, 105 PlacesBefore, 36 PlacesAfterwards, 97 TransitionsBefore, 27 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 4118 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1781, positive: 1630, positive conditional: 0, positive unconditional: 1630, negative: 151, negative conditional: 0, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 981, positive: 944, positive conditional: 0, positive unconditional: 944, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 981, positive: 932, positive conditional: 0, positive unconditional: 932, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 424, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 398, negative conditional: 0, negative unconditional: 398, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1781, positive: 686, positive conditional: 0, positive unconditional: 686, negative: 114, negative conditional: 0, negative unconditional: 114, unknown: 981, unknown conditional: 0, unknown unconditional: 981] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1906; [L832] FCALL, FORK 0 pthread_create(&t1906, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1907; [L834] FCALL, FORK 0 pthread_create(&t1907, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L835] 0 pthread_t t1908; [L836] FCALL, FORK 0 pthread_create(&t1908, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6491.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 20.7ms, AutomataDifference: 656.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4423.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 360 SDtfs, 450 SDslu, 748 SDs, 0 SdLazy, 301 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 285.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 324.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred in iteration=0, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 135.5ms AutomataMinimizationTime, 13 MinimizatonAttempts, 606 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 32.1ms SsaConstructionTime, 325.5ms SatisfiabilityAnalysisTime, 670.2ms InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...