/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9b7772ad7705253c1305067fc38dc9bc7271fbe3-9b7772a [2021-04-15 00:59:12,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-15 00:59:12,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-15 00:59:12,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-15 00:59:12,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-15 00:59:12,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-15 00:59:12,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-15 00:59:12,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-15 00:59:12,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-15 00:59:12,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-15 00:59:12,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-15 00:59:12,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-15 00:59:12,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-15 00:59:12,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-15 00:59:12,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-15 00:59:12,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-15 00:59:12,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-15 00:59:12,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-15 00:59:12,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-15 00:59:12,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-15 00:59:12,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-15 00:59:12,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-15 00:59:12,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-15 00:59:12,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-15 00:59:13,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-15 00:59:13,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-15 00:59:13,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-15 00:59:13,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-15 00:59:13,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-15 00:59:13,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-15 00:59:13,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-15 00:59:13,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-15 00:59:13,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-15 00:59:13,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-15 00:59:13,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-15 00:59:13,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-15 00:59:13,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-15 00:59:13,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-15 00:59:13,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-15 00:59:13,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-15 00:59:13,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-15 00:59:13,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-04-15 00:59:13,050 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-15 00:59:13,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-15 00:59:13,050 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-04-15 00:59:13,050 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-04-15 00:59:13,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-15 00:59:13,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-15 00:59:13,052 INFO L138 SettingsManager]: * Use SBE=true [2021-04-15 00:59:13,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-15 00:59:13,052 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-15 00:59:13,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-15 00:59:13,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-15 00:59:13,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-15 00:59:13,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-15 00:59:13,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-15 00:59:13,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-15 00:59:13,053 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-15 00:59:13,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-15 00:59:13,053 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-15 00:59:13,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-15 00:59:13,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-15 00:59:13,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-15 00:59:13,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-15 00:59:13,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-15 00:59:13,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 00:59:13,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-15 00:59:13,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-15 00:59:13,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-15 00:59:13,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-15 00:59:13,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-15 00:59:13,055 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-04-15 00:59:13,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-15 00:59:13,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-04-15 00:59:13,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-15 00:59:13,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-15 00:59:13,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-15 00:59:13,374 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-15 00:59:13,375 INFO L275 PluginConnector]: CDTParser initialized [2021-04-15 00:59:13,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2021-04-15 00:59:13,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754042c9e/5e432a99c53b4f808e01e11acd735be3/FLAGa2a1bd268 [2021-04-15 00:59:14,039 INFO L306 CDTParser]: Found 1 translation units. [2021-04-15 00:59:14,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2021-04-15 00:59:14,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754042c9e/5e432a99c53b4f808e01e11acd735be3/FLAGa2a1bd268 [2021-04-15 00:59:14,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754042c9e/5e432a99c53b4f808e01e11acd735be3 [2021-04-15 00:59:14,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-15 00:59:14,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-15 00:59:14,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-15 00:59:14,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-15 00:59:14,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-15 00:59:14,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:59:14" (1/1) ... [2021-04-15 00:59:14,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9c1660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:14, skipping insertion in model container [2021-04-15 00:59:14,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:59:14" (1/1) ... [2021-04-15 00:59:14,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-15 00:59:14,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-15 00:59:14,723 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/safe010_power.oepc.i[952,965] [2021-04-15 00:59:14,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 00:59:14,930 INFO L203 MainTranslator]: Completed pre-run [2021-04-15 00:59:14,944 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i[952,965] [2021-04-15 00:59:14,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 00:59:15,060 INFO L208 MainTranslator]: Completed translation [2021-04-15 00:59:15,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15 WrapperNode [2021-04-15 00:59:15,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-15 00:59:15,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-15 00:59:15,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-15 00:59:15,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-15 00:59:15,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (1/1) ... [2021-04-15 00:59:15,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (1/1) ... [2021-04-15 00:59:15,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-15 00:59:15,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-15 00:59:15,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-15 00:59:15,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-15 00:59:15,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (1/1) ... [2021-04-15 00:59:15,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (1/1) ... [2021-04-15 00:59:15,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (1/1) ... [2021-04-15 00:59:15,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (1/1) ... [2021-04-15 00:59:15,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (1/1) ... [2021-04-15 00:59:15,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (1/1) ... [2021-04-15 00:59:15,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (1/1) ... [2021-04-15 00:59:15,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-15 00:59:15,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-15 00:59:15,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-15 00:59:15,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-15 00:59:15,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 00:59:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-15 00:59:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-15 00:59:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-15 00:59:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-15 00:59:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-15 00:59:15,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-15 00:59:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-15 00:59:15,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-15 00:59:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-15 00:59:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-15 00:59:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-15 00:59:15,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-15 00:59:15,276 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-15 00:59:16,915 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-15 00:59:16,916 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-15 00:59:16,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:59:16 BoogieIcfgContainer [2021-04-15 00:59:16,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-15 00:59:16,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-15 00:59:16,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-15 00:59:16,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-15 00:59:16,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:59:14" (1/3) ... [2021-04-15 00:59:16,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8f3a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:59:16, skipping insertion in model container [2021-04-15 00:59:16,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:59:15" (2/3) ... [2021-04-15 00:59:16,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8f3a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:59:16, skipping insertion in model container [2021-04-15 00:59:16,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:59:16" (3/3) ... [2021-04-15 00:59:16,923 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2021-04-15 00:59:16,928 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-04-15 00:59:16,928 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-15 00:59:16,932 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-15 00:59:16,932 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-15 00:59:16,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,957 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,957 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,959 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,959 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,969 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,969 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,969 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,971 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,971 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:59:16,973 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-15 00:59:16,987 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-04-15 00:59:17,002 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-15 00:59:17,002 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-15 00:59:17,003 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-15 00:59:17,003 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-15 00:59:17,003 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-15 00:59:17,003 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-15 00:59:17,003 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-15 00:59:17,003 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-15 00:59:17,011 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 80 transitions, 170 flow [2021-04-15 00:59:17,075 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1798 states, 1794 states have (on average 2.759197324414716) internal successors, (4950), 1797 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 1798 states, 1794 states have (on average 2.759197324414716) internal successors, (4950), 1797 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-04-15 00:59:17,107 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:59:17,109 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:59:17,109 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:59:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:59:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash 932370220, now seen corresponding path program 1 times [2021-04-15 00:59:17,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:59:17,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821048343] [2021-04-15 00:59:17,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:59:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:59:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:59:17,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821048343] [2021-04-15 00:59:17,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:59:17,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-15 00:59:17,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610757980] [2021-04-15 00:59:17,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 00:59:17,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:59:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 00:59:17,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 00:59:17,398 INFO L87 Difference]: Start difference. First operand has 1798 states, 1794 states have (on average 2.759197324414716) internal successors, (4950), 1797 states have internal predecessors, (4950), 0 states have call successors, (0), 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 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:59:17,497 INFO L93 Difference]: Finished difference Result 1538 states and 4078 transitions. [2021-04-15 00:59:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 00:59:17,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-04-15 00:59:17,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:59:17,520 INFO L225 Difference]: With dead ends: 1538 [2021-04-15 00:59:17,520 INFO L226 Difference]: Without dead ends: 962 [2021-04-15 00:59:17,522 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 00:59:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-04-15 00:59:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2021-04-15 00:59:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 2.595213319458897) internal successors, (2494), 961 states have internal predecessors, (2494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2494 transitions. [2021-04-15 00:59:17,615 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2494 transitions. Word has length 36 [2021-04-15 00:59:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:59:17,616 INFO L480 AbstractCegarLoop]: Abstraction has 962 states and 2494 transitions. [2021-04-15 00:59:17,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2494 transitions. [2021-04-15 00:59:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-15 00:59:17,627 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:59:17,627 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:59:17,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-15 00:59:17,628 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:59:17,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:59:17,631 INFO L82 PathProgramCache]: Analyzing trace with hash -140732567, now seen corresponding path program 1 times [2021-04-15 00:59:17,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:59:17,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2257248] [2021-04-15 00:59:17,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:59:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:59:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:59:17,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2257248] [2021-04-15 00:59:17,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:59:17,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:59:17,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205541332] [2021-04-15 00:59:17,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:59:17,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:59:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:59:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:59:17,883 INFO L87 Difference]: Start difference. First operand 962 states and 2494 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:59:18,028 INFO L93 Difference]: Finished difference Result 1122 states and 2874 transitions. [2021-04-15 00:59:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:59:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-04-15 00:59:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:59:18,033 INFO L225 Difference]: With dead ends: 1122 [2021-04-15 00:59:18,033 INFO L226 Difference]: Without dead ends: 866 [2021-04-15 00:59:18,034 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 117.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:59:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2021-04-15 00:59:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2021-04-15 00:59:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 2.564161849710983) internal successors, (2218), 865 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 2218 transitions. [2021-04-15 00:59:18,073 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 2218 transitions. Word has length 51 [2021-04-15 00:59:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:59:18,073 INFO L480 AbstractCegarLoop]: Abstraction has 866 states and 2218 transitions. [2021-04-15 00:59:18,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 2218 transitions. [2021-04-15 00:59:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-04-15 00:59:18,083 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:59:18,083 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:59:18,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-15 00:59:18,084 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:59:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:59:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash 20195882, now seen corresponding path program 1 times [2021-04-15 00:59:18,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:59:18,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987632721] [2021-04-15 00:59:18,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:59:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:59:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:59:18,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987632721] [2021-04-15 00:59:18,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:59:18,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 00:59:18,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574231517] [2021-04-15 00:59:18,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 00:59:18,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:59:18,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 00:59:18,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:59:18,366 INFO L87 Difference]: Start difference. First operand 866 states and 2218 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:59:19,076 INFO L93 Difference]: Finished difference Result 1040 states and 2636 transitions. [2021-04-15 00:59:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-04-15 00:59:19,077 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-04-15 00:59:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:59:19,081 INFO L225 Difference]: With dead ends: 1040 [2021-04-15 00:59:19,081 INFO L226 Difference]: Without dead ends: 848 [2021-04-15 00:59:19,082 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 546.8ms TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2021-04-15 00:59:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2021-04-15 00:59:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 842. [2021-04-15 00:59:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 2.5517241379310347) internal successors, (2146), 841 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2146 transitions. [2021-04-15 00:59:19,102 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2146 transitions. Word has length 53 [2021-04-15 00:59:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:59:19,104 INFO L480 AbstractCegarLoop]: Abstraction has 842 states and 2146 transitions. [2021-04-15 00:59:19,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2146 transitions. [2021-04-15 00:59:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-04-15 00:59:19,106 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:59:19,106 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:59:19,106 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-15 00:59:19,106 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:59:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:59:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1812777256, now seen corresponding path program 1 times [2021-04-15 00:59:19,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:59:19,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450948929] [2021-04-15 00:59:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:59:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:59:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:59:19,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450948929] [2021-04-15 00:59:19,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:59:19,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 00:59:19,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903544395] [2021-04-15 00:59:19,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 00:59:19,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:59:19,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 00:59:19,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-04-15 00:59:19,297 INFO L87 Difference]: Start difference. First operand 842 states and 2146 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:59:19,456 INFO L93 Difference]: Finished difference Result 1174 states and 2986 transitions. [2021-04-15 00:59:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 00:59:19,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-04-15 00:59:19,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:59:19,465 INFO L225 Difference]: With dead ends: 1174 [2021-04-15 00:59:19,465 INFO L226 Difference]: Without dead ends: 614 [2021-04-15 00:59:19,466 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 125.6ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-04-15 00:59:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-04-15 00:59:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-04-15 00:59:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 2.4437194127243065) internal successors, (1498), 613 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1498 transitions. [2021-04-15 00:59:19,480 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1498 transitions. Word has length 55 [2021-04-15 00:59:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:59:19,480 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 1498 transitions. [2021-04-15 00:59:19,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1498 transitions. [2021-04-15 00:59:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-04-15 00:59:19,482 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:59:19,482 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:59:19,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-15 00:59:19,483 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:59:19,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:59:19,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1255041637, now seen corresponding path program 1 times [2021-04-15 00:59:19,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:59:19,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216894131] [2021-04-15 00:59:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:59:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:59:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:59:19,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216894131] [2021-04-15 00:59:19,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:59:19,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 00:59:19,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172823222] [2021-04-15 00:59:19,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 00:59:19,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:59:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 00:59:19,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-04-15 00:59:19,813 INFO L87 Difference]: Start difference. First operand 614 states and 1498 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:59:20,467 INFO L93 Difference]: Finished difference Result 740 states and 1797 transitions. [2021-04-15 00:59:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-04-15 00:59:20,468 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-04-15 00:59:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:59:20,472 INFO L225 Difference]: With dead ends: 740 [2021-04-15 00:59:20,472 INFO L226 Difference]: Without dead ends: 620 [2021-04-15 00:59:20,473 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 552.3ms TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2021-04-15 00:59:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-04-15 00:59:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2021-04-15 00:59:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 2.4378029079159935) internal successors, (1509), 619 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1509 transitions. [2021-04-15 00:59:20,487 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1509 transitions. Word has length 56 [2021-04-15 00:59:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:59:20,487 INFO L480 AbstractCegarLoop]: Abstraction has 620 states and 1509 transitions. [2021-04-15 00:59:20,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1509 transitions. [2021-04-15 00:59:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-04-15 00:59:20,489 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:59:20,490 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:59:20,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-15 00:59:20,490 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:59:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:59:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1257034871, now seen corresponding path program 2 times [2021-04-15 00:59:20,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:59:20,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440413136] [2021-04-15 00:59:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:59:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:59:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:59:20,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440413136] [2021-04-15 00:59:20,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:59:20,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-15 00:59:20,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625277887] [2021-04-15 00:59:20,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-15 00:59:20,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:59:20,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-15 00:59:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-04-15 00:59:20,683 INFO L87 Difference]: Start difference. First operand 620 states and 1509 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:59:20,843 INFO L93 Difference]: Finished difference Result 734 states and 1778 transitions. [2021-04-15 00:59:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 00:59:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-04-15 00:59:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:59:20,846 INFO L225 Difference]: With dead ends: 734 [2021-04-15 00:59:20,846 INFO L226 Difference]: Without dead ends: 614 [2021-04-15 00:59:20,846 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 157.1ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-04-15 00:59:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-04-15 00:59:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-04-15 00:59:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 2.432300163132137) internal successors, (1491), 613 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1491 transitions. [2021-04-15 00:59:20,859 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1491 transitions. Word has length 56 [2021-04-15 00:59:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:59:20,859 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 1491 transitions. [2021-04-15 00:59:20,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1491 transitions. [2021-04-15 00:59:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-04-15 00:59:20,861 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:59:20,861 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:59:20,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-15 00:59:20,861 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:59:20,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:59:20,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2017996263, now seen corresponding path program 1 times [2021-04-15 00:59:20,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:59:20,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538496918] [2021-04-15 00:59:20,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:59:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:59:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:59:20,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538496918] [2021-04-15 00:59:20,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:59:20,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:59:20,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999398134] [2021-04-15 00:59:20,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:59:20,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:59:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:59:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:59:20,943 INFO L87 Difference]: Start difference. First operand 614 states and 1491 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:59:21,023 INFO L93 Difference]: Finished difference Result 666 states and 1578 transitions. [2021-04-15 00:59:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:59:21,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-04-15 00:59:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:59:21,026 INFO L225 Difference]: With dead ends: 666 [2021-04-15 00:59:21,026 INFO L226 Difference]: Without dead ends: 482 [2021-04-15 00:59:21,026 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 75.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:59:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-04-15 00:59:21,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2021-04-15 00:59:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 2.3284823284823286) internal successors, (1120), 481 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1120 transitions. [2021-04-15 00:59:21,036 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1120 transitions. Word has length 57 [2021-04-15 00:59:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:59:21,037 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 1120 transitions. [2021-04-15 00:59:21,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1120 transitions. [2021-04-15 00:59:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-04-15 00:59:21,038 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:59:21,038 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:59:21,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-15 00:59:21,038 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:59:21,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:59:21,039 INFO L82 PathProgramCache]: Analyzing trace with hash -5868166, now seen corresponding path program 1 times [2021-04-15 00:59:21,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:59:21,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748844917] [2021-04-15 00:59:21,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:59:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:59:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:59:21,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748844917] [2021-04-15 00:59:21,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:59:21,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 00:59:21,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494424799] [2021-04-15 00:59:21,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 00:59:21,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:59:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 00:59:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-15 00:59:21,125 INFO L87 Difference]: Start difference. First operand 482 states and 1120 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:59:21,228 INFO L93 Difference]: Finished difference Result 386 states and 843 transitions. [2021-04-15 00:59:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 00:59:21,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-04-15 00:59:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:59:21,229 INFO L225 Difference]: With dead ends: 386 [2021-04-15 00:59:21,229 INFO L226 Difference]: Without dead ends: 266 [2021-04-15 00:59:21,230 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 95.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-04-15 00:59:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-04-15 00:59:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-04-15 00:59:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.0528301886792453) internal successors, (544), 265 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 544 transitions. [2021-04-15 00:59:21,235 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 544 transitions. Word has length 58 [2021-04-15 00:59:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:59:21,235 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 544 transitions. [2021-04-15 00:59:21,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:21,235 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 544 transitions. [2021-04-15 00:59:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-04-15 00:59:21,236 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:59:21,236 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:59:21,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-15 00:59:21,237 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:59:21,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:59:21,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1489734363, now seen corresponding path program 1 times [2021-04-15 00:59:21,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:59:21,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240001733] [2021-04-15 00:59:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:59:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:59:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:59:21,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240001733] [2021-04-15 00:59:21,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:59:21,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 00:59:21,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655117085] [2021-04-15 00:59:21,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 00:59:21,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:59:21,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 00:59:21,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-04-15 00:59:21,474 INFO L87 Difference]: Start difference. First operand 266 states and 544 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:59:21,631 INFO L93 Difference]: Finished difference Result 396 states and 836 transitions. [2021-04-15 00:59:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 00:59:21,631 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-04-15 00:59:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:59:21,632 INFO L225 Difference]: With dead ends: 396 [2021-04-15 00:59:21,632 INFO L226 Difference]: Without dead ends: 226 [2021-04-15 00:59:21,633 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 166.4ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-04-15 00:59:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-04-15 00:59:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-04-15 00:59:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 2.008888888888889) internal successors, (452), 225 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 452 transitions. [2021-04-15 00:59:21,637 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 452 transitions. Word has length 61 [2021-04-15 00:59:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:59:21,637 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 452 transitions. [2021-04-15 00:59:21,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:59:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 452 transitions. [2021-04-15 00:59:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-04-15 00:59:21,638 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:59:21,638 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:59:21,639 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-15 00:59:21,639 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:59:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:59:21,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2137114405, now seen corresponding path program 2 times [2021-04-15 00:59:21,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:59:21,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689237566] [2021-04-15 00:59:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:59:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 00:59:21,668 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 00:59:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 00:59:21,702 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 00:59:21,729 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-15 00:59:21,729 INFO L652 BasicCegarLoop]: Counterexample might be feasible [2021-04-15 00:59:21,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-15 00:59:21,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:59:21 BasicIcfg [2021-04-15 00:59:21,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-15 00:59:21,825 INFO L168 Benchmark]: Toolchain (without parser) took 7375.49 ms. Allocated memory was 255.9 MB in the beginning and 446.7 MB in the end (delta: 190.8 MB). Free memory was 235.0 MB in the beginning and 202.7 MB in the end (delta: 32.3 MB). Peak memory consumption was 222.0 MB. Max. memory is 16.0 GB. [2021-04-15 00:59:21,826 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 00:59:21,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.76 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 235.0 MB in the beginning and 331.5 MB in the end (delta: -96.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-04-15 00:59:21,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.26 ms. Allocated memory is still 371.2 MB. Free memory was 331.2 MB in the beginning and 328.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 00:59:21,826 INFO L168 Benchmark]: Boogie Preprocessor took 58.23 ms. Allocated memory is still 371.2 MB. Free memory was 328.5 MB in the beginning and 326.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 00:59:21,827 INFO L168 Benchmark]: RCFGBuilder took 1720.11 ms. Allocated memory is still 371.2 MB. Free memory was 326.4 MB in the beginning and 286.7 MB in the end (delta: 39.7 MB). Peak memory consumption was 46.2 MB. Max. memory is 16.0 GB. [2021-04-15 00:59:21,827 INFO L168 Benchmark]: TraceAbstraction took 4906.40 ms. Allocated memory was 371.2 MB in the beginning and 446.7 MB in the end (delta: 75.5 MB). Free memory was 286.7 MB in the beginning and 202.7 MB in the end (delta: 84.0 MB). Peak memory consumption was 158.4 MB. Max. memory is 16.0 GB. [2021-04-15 00:59:21,828 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.15 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 610.76 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 235.0 MB in the beginning and 331.5 MB in the end (delta: -96.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 75.26 ms. Allocated memory is still 371.2 MB. Free memory was 331.2 MB in the beginning and 328.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 58.23 ms. Allocated memory is still 371.2 MB. Free memory was 328.5 MB in the beginning and 326.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1720.11 ms. Allocated memory is still 371.2 MB. Free memory was 326.4 MB in the beginning and 286.7 MB in the end (delta: 39.7 MB). Peak memory consumption was 46.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 4906.40 ms. Allocated memory was 371.2 MB in the beginning and 446.7 MB in the end (delta: 75.5 MB). Free memory was 286.7 MB in the beginning and 202.7 MB in the end (delta: 84.0 MB). Peak memory consumption was 158.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2009; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4730.1ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 60.9ms, AutomataDifference: 2354.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 71.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 763 SDtfs, 1324 SDslu, 2872 SDs, 0 SdLazy, 686 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 671.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1844.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1798occurred in iteration=0, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 200.6ms AutomataMinimizationTime, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 38.9ms SsaConstructionTime, 415.4ms SatisfiabilityAnalysisTime, 1337.2ms InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 2873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...