/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/safe017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 17:31:38,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 17:31:38,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 17:31:38,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 17:31:38,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 17:31:38,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 17:31:38,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 17:31:38,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 17:31:38,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 17:31:38,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 17:31:38,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 17:31:38,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 17:31:38,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 17:31:38,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 17:31:38,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 17:31:38,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 17:31:38,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 17:31:38,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 17:31:38,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 17:31:38,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 17:31:38,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 17:31:38,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 17:31:38,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 17:31:38,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 17:31:38,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 17:31:38,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 17:31:38,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 17:31:38,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 17:31:38,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 17:31:38,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 17:31:38,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 17:31:38,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 17:31:38,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 17:31:38,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 17:31:38,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 17:31:38,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 17:31:38,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 17:31:38,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 17:31:38,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 17:31:38,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 17:31:38,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 17:31:38,257 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-03-10 17:31:38,294 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 17:31:38,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 17:31:38,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 17:31:38,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 17:31:38,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 17:31:38,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 17:31:38,298 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 17:31:38,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 17:31:38,298 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 17:31:38,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 17:31:38,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 17:31:38,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 17:31:38,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 17:31:38,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 17:31:38,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 17:31:38,300 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 17:31:38,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 17:31:38,300 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 17:31:38,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 17:31:38,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 17:31:38,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 17:31:38,300 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 17:31:38,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 17:31:38,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 17:31:38,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 17:31:38,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 17:31:38,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 17:31:38,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 17:31:38,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 17:31:38,301 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 17:31:38,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 17:31:38,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-10 17:31:38,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 17:31:38,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 17:31:38,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 17:31:38,631 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-10 17:31:38,632 INFO L275 PluginConnector]: CDTParser initialized [2021-03-10 17:31:38,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2021-03-10 17:31:38,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169daa2fa/0d99fec0fc744844af44a739d1e43435/FLAG1a745b228 [2021-03-10 17:31:39,210 INFO L306 CDTParser]: Found 1 translation units. [2021-03-10 17:31:39,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2021-03-10 17:31:39,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169daa2fa/0d99fec0fc744844af44a739d1e43435/FLAG1a745b228 [2021-03-10 17:31:39,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169daa2fa/0d99fec0fc744844af44a739d1e43435 [2021-03-10 17:31:39,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 17:31:39,669 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-10 17:31:39,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-10 17:31:39,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-10 17:31:39,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-10 17:31:39,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:31:39" (1/1) ... [2021-03-10 17:31:39,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283b9c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:39, skipping insertion in model container [2021-03-10 17:31:39,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:31:39" (1/1) ... [2021-03-10 17:31:39,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-10 17:31:39,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-10 17:31:39,867 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/safe017_rmo.opt.i[949,962] [2021-03-10 17:31:40,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:31:40,073 INFO L203 MainTranslator]: Completed pre-run [2021-03-10 17:31:40,081 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/safe017_rmo.opt.i[949,962] [2021-03-10 17:31:40,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:31:40,182 INFO L208 MainTranslator]: Completed translation [2021-03-10 17:31:40,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40 WrapperNode [2021-03-10 17:31:40,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-10 17:31:40,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 17:31:40,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 17:31:40,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 17:31:40,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (1/1) ... [2021-03-10 17:31:40,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (1/1) ... [2021-03-10 17:31:40,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 17:31:40,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 17:31:40,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 17:31:40,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 17:31:40,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (1/1) ... [2021-03-10 17:31:40,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (1/1) ... [2021-03-10 17:31:40,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (1/1) ... [2021-03-10 17:31:40,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (1/1) ... [2021-03-10 17:31:40,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (1/1) ... [2021-03-10 17:31:40,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (1/1) ... [2021-03-10 17:31:40,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (1/1) ... [2021-03-10 17:31:40,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 17:31:40,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 17:31:40,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 17:31:40,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 17:31:40,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 17:31:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-10 17:31:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-10 17:31:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-10 17:31:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-10 17:31:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-10 17:31:40,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-10 17:31:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-10 17:31:40,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-10 17:31:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-10 17:31:40,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-10 17:31:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-10 17:31:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-10 17:31:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 17:31:40,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 17:31:40,407 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 17:31:42,094 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 17:31:42,095 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-10 17:31:42,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:31:42 BoogieIcfgContainer [2021-03-10 17:31:42,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 17:31:42,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 17:31:42,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 17:31:42,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 17:31:42,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.03 05:31:39" (1/3) ... [2021-03-10 17:31:42,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1074db73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:31:42, skipping insertion in model container [2021-03-10 17:31:42,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:40" (2/3) ... [2021-03-10 17:31:42,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1074db73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:31:42, skipping insertion in model container [2021-03-10 17:31:42,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:31:42" (3/3) ... [2021-03-10 17:31:42,102 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2021-03-10 17:31:42,108 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 17:31:42,108 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 17:31:42,112 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-10 17:31:42,112 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 17:31:42,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,140 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,140 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,141 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,141 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,141 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,141 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,142 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,142 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,145 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,146 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,146 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,146 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,149 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,150 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,150 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,150 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,154 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,155 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,157 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,158 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:42,162 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-10 17:31:42,176 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-10 17:31:42,192 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 17:31:42,192 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 17:31:42,192 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 17:31:42,192 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 17:31:42,192 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 17:31:42,192 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 17:31:42,192 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 17:31:42,193 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 17:31:42,201 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 95 transitions, 205 flow [2021-03-10 17:31:42,865 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13428 states, 13424 states have (on average 3.6315554231227654) internal successors, (48750), 13427 states have internal predecessors, (48750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 13428 states, 13424 states have (on average 3.6315554231227654) internal successors, (48750), 13427 states have internal predecessors, (48750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-03-10 17:31:42,905 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:42,905 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:42,906 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:42,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:42,911 INFO L82 PathProgramCache]: Analyzing trace with hash -186725599, now seen corresponding path program 1 times [2021-03-10 17:31:42,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:42,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514486264] [2021-03-10 17:31:42,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:43,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514486264] [2021-03-10 17:31:43,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:43,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-10 17:31:43,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440402563] [2021-03-10 17:31:43,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-10 17:31:43,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:43,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-10 17:31:43,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:31:43,260 INFO L87 Difference]: Start difference. First operand has 13428 states, 13424 states have (on average 3.6315554231227654) internal successors, (48750), 13427 states have internal predecessors, (48750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:43,502 INFO L93 Difference]: Finished difference Result 11492 states and 40660 transitions. [2021-03-10 17:31:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 17:31:43,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-03-10 17:31:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:43,571 INFO L225 Difference]: With dead ends: 11492 [2021-03-10 17:31:43,571 INFO L226 Difference]: Without dead ends: 6564 [2021-03-10 17:31:43,572 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:31:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2021-03-10 17:31:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 6564. [2021-03-10 17:31:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6564 states, 6563 states have (on average 3.4868200518055765) internal successors, (22884), 6563 states have internal predecessors, (22884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6564 states to 6564 states and 22884 transitions. [2021-03-10 17:31:43,987 INFO L78 Accepts]: Start accepts. Automaton has 6564 states and 22884 transitions. Word has length 38 [2021-03-10 17:31:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:43,988 INFO L480 AbstractCegarLoop]: Abstraction has 6564 states and 22884 transitions. [2021-03-10 17:31:43,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6564 states and 22884 transitions. [2021-03-10 17:31:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-03-10 17:31:44,007 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:44,007 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:44,007 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 17:31:44,007 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:44,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1293174682, now seen corresponding path program 1 times [2021-03-10 17:31:44,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:44,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73978945] [2021-03-10 17:31:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:44,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73978945] [2021-03-10 17:31:44,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:44,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:31:44,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119694534] [2021-03-10 17:31:44,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:31:44,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:44,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:31:44,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:31:44,278 INFO L87 Difference]: Start difference. First operand 6564 states and 22884 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-03-10 17:31:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:44,532 INFO L93 Difference]: Finished difference Result 7684 states and 26504 transitions. [2021-03-10 17:31:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:31:44,533 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-03-10 17:31:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:44,609 INFO L225 Difference]: With dead ends: 7684 [2021-03-10 17:31:44,610 INFO L226 Difference]: Without dead ends: 5892 [2021-03-10 17:31:44,611 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 121.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:31:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2021-03-10 17:31:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5892. [2021-03-10 17:31:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5892 states, 5891 states have (on average 3.4588355117976572) internal successors, (20376), 5891 states have internal predecessors, (20376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5892 states to 5892 states and 20376 transitions. [2021-03-10 17:31:44,789 INFO L78 Accepts]: Start accepts. Automaton has 5892 states and 20376 transitions. Word has length 57 [2021-03-10 17:31:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:44,790 INFO L480 AbstractCegarLoop]: Abstraction has 5892 states and 20376 transitions. [2021-03-10 17:31:44,790 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-03-10 17:31:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5892 states and 20376 transitions. [2021-03-10 17:31:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-03-10 17:31:44,801 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:44,802 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:44,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 17:31:44,802 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash 456860895, now seen corresponding path program 1 times [2021-03-10 17:31:44,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:44,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176310989] [2021-03-10 17:31:44,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:45,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176310989] [2021-03-10 17:31:45,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:45,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:31:45,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357289181] [2021-03-10 17:31:45,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:31:45,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:31:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:31:45,041 INFO L87 Difference]: Start difference. First operand 5892 states and 20376 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:45,261 INFO L93 Difference]: Finished difference Result 9420 states and 32520 transitions. [2021-03-10 17:31:45,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:31:45,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-03-10 17:31:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:45,309 INFO L225 Difference]: With dead ends: 9420 [2021-03-10 17:31:45,309 INFO L226 Difference]: Without dead ends: 5388 [2021-03-10 17:31:45,310 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 138.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:31:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5388 states. [2021-03-10 17:31:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5388 to 5388. [2021-03-10 17:31:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5388 states, 5387 states have (on average 3.421570447373306) internal successors, (18432), 5387 states have internal predecessors, (18432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5388 states to 5388 states and 18432 transitions. [2021-03-10 17:31:45,527 INFO L78 Accepts]: Start accepts. Automaton has 5388 states and 18432 transitions. Word has length 59 [2021-03-10 17:31:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:45,529 INFO L480 AbstractCegarLoop]: Abstraction has 5388 states and 18432 transitions. [2021-03-10 17:31:45,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 5388 states and 18432 transitions. [2021-03-10 17:31:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-03-10 17:31:45,538 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:45,538 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:45,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 17:31:45,539 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:45,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:45,540 INFO L82 PathProgramCache]: Analyzing trace with hash 547779774, now seen corresponding path program 1 times [2021-03-10 17:31:45,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:45,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522830550] [2021-03-10 17:31:45,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:45,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522830550] [2021-03-10 17:31:45,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:45,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:31:45,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409800916] [2021-03-10 17:31:45,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:31:45,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:31:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:31:45,799 INFO L87 Difference]: Start difference. First operand 5388 states and 18432 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 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-03-10 17:31:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:46,122 INFO L93 Difference]: Finished difference Result 6560 states and 22296 transitions. [2021-03-10 17:31:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:31:46,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 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-03-10 17:31:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:46,142 INFO L225 Difference]: With dead ends: 6560 [2021-03-10 17:31:46,142 INFO L226 Difference]: Without dead ends: 5568 [2021-03-10 17:31:46,143 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 218.5ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:31:46,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2021-03-10 17:31:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 5328. [2021-03-10 17:31:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5328 states, 5327 states have (on average 3.4173080533133096) internal successors, (18204), 5327 states have internal predecessors, (18204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5328 states to 5328 states and 18204 transitions. [2021-03-10 17:31:46,380 INFO L78 Accepts]: Start accepts. Automaton has 5328 states and 18204 transitions. Word has length 61 [2021-03-10 17:31:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:46,382 INFO L480 AbstractCegarLoop]: Abstraction has 5328 states and 18204 transitions. [2021-03-10 17:31:46,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 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-03-10 17:31:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 5328 states and 18204 transitions. [2021-03-10 17:31:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-03-10 17:31:46,394 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:46,394 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:46,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 17:31:46,394 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:46,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:46,395 INFO L82 PathProgramCache]: Analyzing trace with hash 327960956, now seen corresponding path program 1 times [2021-03-10 17:31:46,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:46,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408440048] [2021-03-10 17:31:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:46,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408440048] [2021-03-10 17:31:46,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:46,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 17:31:46,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462706873] [2021-03-10 17:31:46,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 17:31:46,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 17:31:46,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 17:31:46,599 INFO L87 Difference]: Start difference. First operand 5328 states and 18204 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:46,869 INFO L93 Difference]: Finished difference Result 6194 states and 21032 transitions. [2021-03-10 17:31:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:31:46,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-03-10 17:31:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:46,888 INFO L225 Difference]: With dead ends: 6194 [2021-03-10 17:31:46,889 INFO L226 Difference]: Without dead ends: 5394 [2021-03-10 17:31:46,889 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 145.3ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:31:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2021-03-10 17:31:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 5338. [2021-03-10 17:31:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5338 states, 5337 states have (on average 3.4161513959153083) internal successors, (18232), 5337 states have internal predecessors, (18232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5338 states to 5338 states and 18232 transitions. [2021-03-10 17:31:47,119 INFO L78 Accepts]: Start accepts. Automaton has 5338 states and 18232 transitions. Word has length 62 [2021-03-10 17:31:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:47,122 INFO L480 AbstractCegarLoop]: Abstraction has 5338 states and 18232 transitions. [2021-03-10 17:31:47,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5338 states and 18232 transitions. [2021-03-10 17:31:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-03-10 17:31:47,137 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:47,137 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:47,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 17:31:47,138 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1766176550, now seen corresponding path program 2 times [2021-03-10 17:31:47,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:47,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213322419] [2021-03-10 17:31:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:47,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213322419] [2021-03-10 17:31:47,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:47,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 17:31:47,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914685416] [2021-03-10 17:31:47,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 17:31:47,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:47,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 17:31:47,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-10 17:31:47,335 INFO L87 Difference]: Start difference. First operand 5338 states and 18232 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:47,583 INFO L93 Difference]: Finished difference Result 5894 states and 19992 transitions. [2021-03-10 17:31:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 17:31:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-03-10 17:31:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:47,599 INFO L225 Difference]: With dead ends: 5894 [2021-03-10 17:31:47,599 INFO L226 Difference]: Without dead ends: 5094 [2021-03-10 17:31:47,599 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 141.1ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:31:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5094 states. [2021-03-10 17:31:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5094 to 5028. [2021-03-10 17:31:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5028 states, 5027 states have (on average 3.4064054107817783) internal successors, (17124), 5027 states have internal predecessors, (17124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 17124 transitions. [2021-03-10 17:31:47,738 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 17124 transitions. Word has length 62 [2021-03-10 17:31:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:47,739 INFO L480 AbstractCegarLoop]: Abstraction has 5028 states and 17124 transitions. [2021-03-10 17:31:47,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 17124 transitions. [2021-03-10 17:31:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-03-10 17:31:47,809 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:47,809 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:47,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 17:31:47,810 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1010842488, now seen corresponding path program 1 times [2021-03-10 17:31:47,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:47,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512176526] [2021-03-10 17:31:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:47,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512176526] [2021-03-10 17:31:47,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:47,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:31:47,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977165987] [2021-03-10 17:31:47,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:31:47,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:47,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:31:47,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:31:47,928 INFO L87 Difference]: Start difference. First operand 5028 states and 17124 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:48,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:48,151 INFO L93 Difference]: Finished difference Result 11708 states and 39368 transitions. [2021-03-10 17:31:48,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:48,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-03-10 17:31:48,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:48,167 INFO L225 Difference]: With dead ends: 11708 [2021-03-10 17:31:48,168 INFO L226 Difference]: Without dead ends: 5088 [2021-03-10 17:31:48,168 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 158.6ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:31:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5088 states. [2021-03-10 17:31:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5088 to 4188. [2021-03-10 17:31:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 4187 states have (on average 3.2748984953427276) internal successors, (13712), 4187 states have internal predecessors, (13712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 13712 transitions. [2021-03-10 17:31:48,270 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 13712 transitions. Word has length 62 [2021-03-10 17:31:48,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:48,270 INFO L480 AbstractCegarLoop]: Abstraction has 4188 states and 13712 transitions. [2021-03-10 17:31:48,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 13712 transitions. [2021-03-10 17:31:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-03-10 17:31:48,276 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:48,276 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:48,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 17:31:48,277 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash 448200960, now seen corresponding path program 1 times [2021-03-10 17:31:48,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:48,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830907536] [2021-03-10 17:31:48,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:48,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830907536] [2021-03-10 17:31:48,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:48,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:31:48,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179931054] [2021-03-10 17:31:48,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:31:48,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:48,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:31:48,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:31:48,481 INFO L87 Difference]: Start difference. First operand 4188 states and 13712 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:48,832 INFO L93 Difference]: Finished difference Result 5040 states and 16378 transitions. [2021-03-10 17:31:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:48,833 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-03-10 17:31:48,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:48,848 INFO L225 Difference]: With dead ends: 5040 [2021-03-10 17:31:48,848 INFO L226 Difference]: Without dead ends: 4288 [2021-03-10 17:31:48,848 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 272.2ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:31:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2021-03-10 17:31:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4288. [2021-03-10 17:31:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4288 states, 4287 states have (on average 3.2526242127361793) internal successors, (13944), 4287 states have internal predecessors, (13944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 13944 transitions. [2021-03-10 17:31:48,943 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 13944 transitions. Word has length 63 [2021-03-10 17:31:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:48,943 INFO L480 AbstractCegarLoop]: Abstraction has 4288 states and 13944 transitions. [2021-03-10 17:31:48,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 13944 transitions. [2021-03-10 17:31:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:48,950 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:48,950 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:48,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 17:31:48,951 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:48,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash -344285634, now seen corresponding path program 1 times [2021-03-10 17:31:48,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:48,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114420311] [2021-03-10 17:31:48,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:49,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114420311] [2021-03-10 17:31:49,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:49,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 17:31:49,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508089798] [2021-03-10 17:31:49,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 17:31:49,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 17:31:49,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-10 17:31:49,137 INFO L87 Difference]: Start difference. First operand 4288 states and 13944 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:49,341 INFO L93 Difference]: Finished difference Result 4994 states and 16204 transitions. [2021-03-10 17:31:49,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:31:49,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:49,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:49,354 INFO L225 Difference]: With dead ends: 4994 [2021-03-10 17:31:49,354 INFO L226 Difference]: Without dead ends: 4394 [2021-03-10 17:31:49,354 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 139.7ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:31:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2021-03-10 17:31:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 4303. [2021-03-10 17:31:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4303 states, 4302 states have (on average 3.2498837749883775) internal successors, (13981), 4302 states have internal predecessors, (13981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 13981 transitions. [2021-03-10 17:31:49,448 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 13981 transitions. Word has length 64 [2021-03-10 17:31:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:49,448 INFO L480 AbstractCegarLoop]: Abstraction has 4303 states and 13981 transitions. [2021-03-10 17:31:49,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 13981 transitions. [2021-03-10 17:31:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:49,456 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:49,456 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:49,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 17:31:49,456 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:49,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash 505930228, now seen corresponding path program 1 times [2021-03-10 17:31:49,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:49,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432674203] [2021-03-10 17:31:49,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:49,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432674203] [2021-03-10 17:31:49,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:49,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:31:49,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422628493] [2021-03-10 17:31:49,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:31:49,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:49,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:31:49,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:31:49,765 INFO L87 Difference]: Start difference. First operand 4303 states and 13981 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:50,060 INFO L93 Difference]: Finished difference Result 4831 states and 15633 transitions. [2021-03-10 17:31:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:31:50,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:50,072 INFO L225 Difference]: With dead ends: 4831 [2021-03-10 17:31:50,072 INFO L226 Difference]: Without dead ends: 4255 [2021-03-10 17:31:50,073 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 292.5ms TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:31:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2021-03-10 17:31:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 4143. [2021-03-10 17:31:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 3.2643650410429745) internal successors, (13521), 4142 states have internal predecessors, (13521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 13521 transitions. [2021-03-10 17:31:50,184 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 13521 transitions. Word has length 64 [2021-03-10 17:31:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:50,184 INFO L480 AbstractCegarLoop]: Abstraction has 4143 states and 13521 transitions. [2021-03-10 17:31:50,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 13521 transitions. [2021-03-10 17:31:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:50,194 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:50,194 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:50,194 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-10 17:31:50,195 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:50,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1535985018, now seen corresponding path program 2 times [2021-03-10 17:31:50,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:50,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255390944] [2021-03-10 17:31:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:50,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255390944] [2021-03-10 17:31:50,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:50,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:31:50,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976275500] [2021-03-10 17:31:50,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:31:50,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:50,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:31:50,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:31:50,393 INFO L87 Difference]: Start difference. First operand 4143 states and 13521 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:50,721 INFO L93 Difference]: Finished difference Result 5145 states and 16830 transitions. [2021-03-10 17:31:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:31:50,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:50,732 INFO L225 Difference]: With dead ends: 5145 [2021-03-10 17:31:50,733 INFO L226 Difference]: Without dead ends: 4545 [2021-03-10 17:31:50,733 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 260.0ms TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:31:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2021-03-10 17:31:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4168. [2021-03-10 17:31:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 4167 states have (on average 3.2603791696664266) internal successors, (13586), 4167 states have internal predecessors, (13586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 13586 transitions. [2021-03-10 17:31:50,831 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 13586 transitions. Word has length 64 [2021-03-10 17:31:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:50,831 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 13586 transitions. [2021-03-10 17:31:50,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 13586 transitions. [2021-03-10 17:31:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:50,839 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:50,839 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:50,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-10 17:31:50,839 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:50,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:50,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1529232924, now seen corresponding path program 3 times [2021-03-10 17:31:50,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:50,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652756895] [2021-03-10 17:31:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:51,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652756895] [2021-03-10 17:31:51,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:51,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:31:51,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044225887] [2021-03-10 17:31:51,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:31:51,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:51,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:31:51,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:31:51,047 INFO L87 Difference]: Start difference. First operand 4168 states and 13586 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:51,480 INFO L93 Difference]: Finished difference Result 4909 states and 15961 transitions. [2021-03-10 17:31:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:51,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:51,490 INFO L225 Difference]: With dead ends: 4909 [2021-03-10 17:31:51,490 INFO L226 Difference]: Without dead ends: 4277 [2021-03-10 17:31:51,490 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 313.0ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:31:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4277 states. [2021-03-10 17:31:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4277 to 4257. [2021-03-10 17:31:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4257 states, 4256 states have (on average 3.263157894736842) internal successors, (13888), 4256 states have internal predecessors, (13888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 13888 transitions. [2021-03-10 17:31:51,594 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 13888 transitions. Word has length 64 [2021-03-10 17:31:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:51,595 INFO L480 AbstractCegarLoop]: Abstraction has 4257 states and 13888 transitions. [2021-03-10 17:31:51,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 13888 transitions. [2021-03-10 17:31:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:51,602 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:51,602 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:51,603 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-10 17:31:51,603 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:51,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:51,603 INFO L82 PathProgramCache]: Analyzing trace with hash 218916636, now seen corresponding path program 4 times [2021-03-10 17:31:51,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:51,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853847735] [2021-03-10 17:31:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:51,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853847735] [2021-03-10 17:31:51,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:51,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:31:51,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585016443] [2021-03-10 17:31:51,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:31:51,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:51,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:31:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:31:51,808 INFO L87 Difference]: Start difference. First operand 4257 states and 13888 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:52,128 INFO L93 Difference]: Finished difference Result 5621 states and 18246 transitions. [2021-03-10 17:31:52,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:52,135 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:52,142 INFO L225 Difference]: With dead ends: 5621 [2021-03-10 17:31:52,143 INFO L226 Difference]: Without dead ends: 4365 [2021-03-10 17:31:52,143 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 206.3ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:31:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2021-03-10 17:31:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 4116. [2021-03-10 17:31:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4116 states, 4115 states have (on average 3.2262454434993924) internal successors, (13276), 4115 states have internal predecessors, (13276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 13276 transitions. [2021-03-10 17:31:52,234 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 13276 transitions. Word has length 64 [2021-03-10 17:31:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:52,234 INFO L480 AbstractCegarLoop]: Abstraction has 4116 states and 13276 transitions. [2021-03-10 17:31:52,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 13276 transitions. [2021-03-10 17:31:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:52,242 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:52,242 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:52,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-10 17:31:52,242 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:52,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1708649590, now seen corresponding path program 1 times [2021-03-10 17:31:52,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:52,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470649227] [2021-03-10 17:31:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:52,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470649227] [2021-03-10 17:31:52,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:52,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:31:52,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22308697] [2021-03-10 17:31:52,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:31:52,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:52,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:31:52,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:31:52,491 INFO L87 Difference]: Start difference. First operand 4116 states and 13276 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:52,716 INFO L93 Difference]: Finished difference Result 4734 states and 15149 transitions. [2021-03-10 17:31:52,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:31:52,717 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:52,726 INFO L225 Difference]: With dead ends: 4734 [2021-03-10 17:31:52,726 INFO L226 Difference]: Without dead ends: 4254 [2021-03-10 17:31:52,727 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 190.1ms TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:31:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4254 states. [2021-03-10 17:31:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4254 to 4119. [2021-03-10 17:31:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4119 states, 4118 states have (on average 3.225837785332686) internal successors, (13284), 4118 states have internal predecessors, (13284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 13284 transitions. [2021-03-10 17:31:52,826 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 13284 transitions. Word has length 65 [2021-03-10 17:31:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:52,826 INFO L480 AbstractCegarLoop]: Abstraction has 4119 states and 13284 transitions. [2021-03-10 17:31:52,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 13284 transitions. [2021-03-10 17:31:52,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:52,834 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:52,834 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:52,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-10 17:31:52,834 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:52,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:52,834 INFO L82 PathProgramCache]: Analyzing trace with hash -668759235, now seen corresponding path program 1 times [2021-03-10 17:31:52,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:52,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528634616] [2021-03-10 17:31:52,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:53,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528634616] [2021-03-10 17:31:53,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:53,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:31:53,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531809704] [2021-03-10 17:31:53,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:31:53,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:53,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:31:53,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:31:53,079 INFO L87 Difference]: Start difference. First operand 4119 states and 13284 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:53,502 INFO L93 Difference]: Finished difference Result 4995 states and 15894 transitions. [2021-03-10 17:31:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:53,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:53,512 INFO L225 Difference]: With dead ends: 4995 [2021-03-10 17:31:53,512 INFO L226 Difference]: Without dead ends: 4215 [2021-03-10 17:31:53,514 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 393.3ms TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2021-03-10 17:31:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states. [2021-03-10 17:31:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 4183. [2021-03-10 17:31:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4183 states, 4182 states have (on average 3.210186513629842) internal successors, (13425), 4182 states have internal predecessors, (13425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 13425 transitions. [2021-03-10 17:31:53,607 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 13425 transitions. Word has length 65 [2021-03-10 17:31:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:53,608 INFO L480 AbstractCegarLoop]: Abstraction has 4183 states and 13425 transitions. [2021-03-10 17:31:53,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 13425 transitions. [2021-03-10 17:31:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:53,615 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:53,615 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:53,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-10 17:31:53,615 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -132502342, now seen corresponding path program 2 times [2021-03-10 17:31:53,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:53,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973564122] [2021-03-10 17:31:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:53,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973564122] [2021-03-10 17:31:53,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:53,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:31:53,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959086248] [2021-03-10 17:31:53,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:31:53,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:53,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:31:53,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:31:53,858 INFO L87 Difference]: Start difference. First operand 4183 states and 13425 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:54,115 INFO L93 Difference]: Finished difference Result 5005 states and 16037 transitions. [2021-03-10 17:31:54,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:31:54,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:54,124 INFO L225 Difference]: With dead ends: 5005 [2021-03-10 17:31:54,124 INFO L226 Difference]: Without dead ends: 4525 [2021-03-10 17:31:54,125 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 213.8ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:31:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2021-03-10 17:31:54,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 4189. [2021-03-10 17:31:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 3.2094078319006685) internal successors, (13441), 4188 states have internal predecessors, (13441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 13441 transitions. [2021-03-10 17:31:54,220 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 13441 transitions. Word has length 65 [2021-03-10 17:31:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:54,220 INFO L480 AbstractCegarLoop]: Abstraction has 4189 states and 13441 transitions. [2021-03-10 17:31:54,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 13441 transitions. [2021-03-10 17:31:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:54,227 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:54,227 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:54,227 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-10 17:31:54,227 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:54,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:54,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1785056129, now seen corresponding path program 2 times [2021-03-10 17:31:54,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:54,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966326872] [2021-03-10 17:31:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:54,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966326872] [2021-03-10 17:31:54,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:54,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:31:54,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74872250] [2021-03-10 17:31:54,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:31:54,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:54,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:31:54,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:31:54,518 INFO L87 Difference]: Start difference. First operand 4189 states and 13441 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:55,098 INFO L93 Difference]: Finished difference Result 6670 states and 21275 transitions. [2021-03-10 17:31:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:55,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:55,109 INFO L225 Difference]: With dead ends: 6670 [2021-03-10 17:31:55,109 INFO L226 Difference]: Without dead ends: 4806 [2021-03-10 17:31:55,109 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 551.3ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:31:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2021-03-10 17:31:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4165. [2021-03-10 17:31:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 3.1690682036503364) internal successors, (13196), 4164 states have internal predecessors, (13196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 13196 transitions. [2021-03-10 17:31:55,214 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 13196 transitions. Word has length 65 [2021-03-10 17:31:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:55,214 INFO L480 AbstractCegarLoop]: Abstraction has 4165 states and 13196 transitions. [2021-03-10 17:31:55,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 13196 transitions. [2021-03-10 17:31:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:55,223 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:55,223 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:55,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-10 17:31:55,223 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:55,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:55,223 INFO L82 PathProgramCache]: Analyzing trace with hash -341817256, now seen corresponding path program 3 times [2021-03-10 17:31:55,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:55,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391296826] [2021-03-10 17:31:55,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:55,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391296826] [2021-03-10 17:31:55,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:55,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:31:55,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588352018] [2021-03-10 17:31:55,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:31:55,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:55,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:31:55,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:31:55,487 INFO L87 Difference]: Start difference. First operand 4165 states and 13196 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:55,957 INFO L93 Difference]: Finished difference Result 4978 states and 15640 transitions. [2021-03-10 17:31:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:31:55,958 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:55,966 INFO L225 Difference]: With dead ends: 4978 [2021-03-10 17:31:55,967 INFO L226 Difference]: Without dead ends: 4146 [2021-03-10 17:31:55,967 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 422.5ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-03-10 17:31:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2021-03-10 17:31:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 4108. [2021-03-10 17:31:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4108 states, 4107 states have (on average 3.172875578280984) internal successors, (13031), 4107 states have internal predecessors, (13031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 13031 transitions. [2021-03-10 17:31:56,053 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 13031 transitions. Word has length 65 [2021-03-10 17:31:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:56,053 INFO L480 AbstractCegarLoop]: Abstraction has 4108 states and 13031 transitions. [2021-03-10 17:31:56,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 13031 transitions. [2021-03-10 17:31:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:56,058 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:56,058 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:56,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-10 17:31:56,059 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1575741215, now seen corresponding path program 3 times [2021-03-10 17:31:56,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:56,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178861112] [2021-03-10 17:31:56,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:56,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178861112] [2021-03-10 17:31:56,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:56,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:31:56,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757975000] [2021-03-10 17:31:56,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:31:56,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:56,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:31:56,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:31:56,318 INFO L87 Difference]: Start difference. First operand 4108 states and 13031 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:56,741 INFO L93 Difference]: Finished difference Result 4729 states and 14926 transitions. [2021-03-10 17:31:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:56,742 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:56,748 INFO L225 Difference]: With dead ends: 4729 [2021-03-10 17:31:56,748 INFO L226 Difference]: Without dead ends: 3837 [2021-03-10 17:31:56,748 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 402.0ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:31:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2021-03-10 17:31:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3797. [2021-03-10 17:31:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3797 states, 3796 states have (on average 3.180189673340358) internal successors, (12072), 3796 states have internal predecessors, (12072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 12072 transitions. [2021-03-10 17:31:56,808 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 12072 transitions. Word has length 65 [2021-03-10 17:31:56,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:56,808 INFO L480 AbstractCegarLoop]: Abstraction has 3797 states and 12072 transitions. [2021-03-10 17:31:56,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 12072 transitions. [2021-03-10 17:31:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:56,814 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:56,814 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:56,814 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-10 17:31:56,814 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:56,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1988050776, now seen corresponding path program 4 times [2021-03-10 17:31:56,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:56,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931102817] [2021-03-10 17:31:56,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:57,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931102817] [2021-03-10 17:31:57,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:57,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:31:57,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211492582] [2021-03-10 17:31:57,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:31:57,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:57,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:31:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:31:57,038 INFO L87 Difference]: Start difference. First operand 3797 states and 12072 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:57,394 INFO L93 Difference]: Finished difference Result 4546 states and 14475 transitions. [2021-03-10 17:31:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:57,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:57,401 INFO L225 Difference]: With dead ends: 4546 [2021-03-10 17:31:57,401 INFO L226 Difference]: Without dead ends: 4002 [2021-03-10 17:31:57,401 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 273.4ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:31:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2021-03-10 17:31:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3812. [2021-03-10 17:31:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3812 states, 3811 states have (on average 3.1886643925478877) internal successors, (12152), 3811 states have internal predecessors, (12152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 3812 states and 12152 transitions. [2021-03-10 17:31:57,462 INFO L78 Accepts]: Start accepts. Automaton has 3812 states and 12152 transitions. Word has length 65 [2021-03-10 17:31:57,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:57,462 INFO L480 AbstractCegarLoop]: Abstraction has 3812 states and 12152 transitions. [2021-03-10 17:31:57,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3812 states and 12152 transitions. [2021-03-10 17:31:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:57,467 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:57,467 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:57,467 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-10 17:31:57,467 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:57,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:57,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1345615081, now seen corresponding path program 1 times [2021-03-10 17:31:57,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:57,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126918073] [2021-03-10 17:31:57,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:57,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126918073] [2021-03-10 17:31:57,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:57,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:31:57,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856528432] [2021-03-10 17:31:57,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:31:57,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:57,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:31:57,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:31:57,588 INFO L87 Difference]: Start difference. First operand 3812 states and 12152 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:57,702 INFO L93 Difference]: Finished difference Result 4720 states and 14796 transitions. [2021-03-10 17:31:57,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:31:57,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:57,709 INFO L225 Difference]: With dead ends: 4720 [2021-03-10 17:31:57,709 INFO L226 Difference]: Without dead ends: 3392 [2021-03-10 17:31:57,710 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 91.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:31:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3392 states. [2021-03-10 17:31:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3392 to 3392. [2021-03-10 17:31:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3392 states, 3391 states have (on average 3.143025656148629) internal successors, (10658), 3391 states have internal predecessors, (10658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 10658 transitions. [2021-03-10 17:31:57,768 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 10658 transitions. Word has length 65 [2021-03-10 17:31:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:57,768 INFO L480 AbstractCegarLoop]: Abstraction has 3392 states and 10658 transitions. [2021-03-10 17:31:57,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 10658 transitions. [2021-03-10 17:31:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-03-10 17:31:57,777 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:57,777 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:57,777 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-10 17:31:57,777 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:57,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1433237926, now seen corresponding path program 1 times [2021-03-10 17:31:57,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:57,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756614061] [2021-03-10 17:31:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:57,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756614061] [2021-03-10 17:31:57,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:57,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:31:57,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984949194] [2021-03-10 17:31:57,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:31:57,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:57,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:31:57,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:31:57,853 INFO L87 Difference]: Start difference. First operand 3392 states and 10658 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:57,978 INFO L93 Difference]: Finished difference Result 3446 states and 10472 transitions. [2021-03-10 17:31:57,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:31:57,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-03-10 17:31:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:57,983 INFO L225 Difference]: With dead ends: 3446 [2021-03-10 17:31:57,983 INFO L226 Difference]: Without dead ends: 2366 [2021-03-10 17:31:57,984 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 98.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:31:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2021-03-10 17:31:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2021-03-10 17:31:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2365 states have (on average 2.991966173361522) internal successors, (7076), 2365 states have internal predecessors, (7076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 7076 transitions. [2021-03-10 17:31:58,020 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 7076 transitions. Word has length 66 [2021-03-10 17:31:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:58,020 INFO L480 AbstractCegarLoop]: Abstraction has 2366 states and 7076 transitions. [2021-03-10 17:31:58,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 7076 transitions. [2021-03-10 17:31:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-03-10 17:31:58,023 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:58,023 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:58,023 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-10 17:31:58,023 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:58,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash 40694706, now seen corresponding path program 1 times [2021-03-10 17:31:58,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:58,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402413706] [2021-03-10 17:31:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:58,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402413706] [2021-03-10 17:31:58,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:58,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 17:31:58,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43009290] [2021-03-10 17:31:58,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 17:31:58,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:58,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 17:31:58,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:31:58,230 INFO L87 Difference]: Start difference. First operand 2366 states and 7076 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:58,561 INFO L93 Difference]: Finished difference Result 2740 states and 8117 transitions. [2021-03-10 17:31:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:31:58,561 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-03-10 17:31:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:58,564 INFO L225 Difference]: With dead ends: 2740 [2021-03-10 17:31:58,564 INFO L226 Difference]: Without dead ends: 2414 [2021-03-10 17:31:58,565 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 270.9ms TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2021-03-10 17:31:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2021-03-10 17:31:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2350. [2021-03-10 17:31:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2349 states have (on average 2.9953171562366965) internal successors, (7036), 2349 states have internal predecessors, (7036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 7036 transitions. [2021-03-10 17:31:58,594 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 7036 transitions. Word has length 68 [2021-03-10 17:31:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:58,594 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 7036 transitions. [2021-03-10 17:31:58,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 7036 transitions. [2021-03-10 17:31:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-03-10 17:31:58,597 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:58,597 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:58,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-10 17:31:58,597 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:58,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:58,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1999288178, now seen corresponding path program 2 times [2021-03-10 17:31:58,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:58,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891600622] [2021-03-10 17:31:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:58,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891600622] [2021-03-10 17:31:58,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:58,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-03-10 17:31:58,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261401095] [2021-03-10 17:31:58,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 17:31:58,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:58,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 17:31:58,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:31:58,852 INFO L87 Difference]: Start difference. First operand 2350 states and 7036 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:59,120 INFO L93 Difference]: Finished difference Result 2670 states and 7906 transitions. [2021-03-10 17:31:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:31:59,121 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-03-10 17:31:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:59,125 INFO L225 Difference]: With dead ends: 2670 [2021-03-10 17:31:59,125 INFO L226 Difference]: Without dead ends: 2346 [2021-03-10 17:31:59,125 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 312.8ms TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2021-03-10 17:31:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2021-03-10 17:31:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2346. [2021-03-10 17:31:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 2.9961620469083154) internal successors, (7026), 2345 states have internal predecessors, (7026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 7026 transitions. [2021-03-10 17:31:59,161 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 7026 transitions. Word has length 68 [2021-03-10 17:31:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:59,161 INFO L480 AbstractCegarLoop]: Abstraction has 2346 states and 7026 transitions. [2021-03-10 17:31:59,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 7026 transitions. [2021-03-10 17:31:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-03-10 17:31:59,164 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:59,164 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:59,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-10 17:31:59,165 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1896709202, now seen corresponding path program 3 times [2021-03-10 17:31:59,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:59,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689829590] [2021-03-10 17:31:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:59,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689829590] [2021-03-10 17:31:59,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:59,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 17:31:59,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622749986] [2021-03-10 17:31:59,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 17:31:59,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:59,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 17:31:59,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:31:59,418 INFO L87 Difference]: Start difference. First operand 2346 states and 7026 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:59,672 INFO L93 Difference]: Finished difference Result 3392 states and 10177 transitions. [2021-03-10 17:31:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:59,673 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-03-10 17:31:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:59,676 INFO L225 Difference]: With dead ends: 3392 [2021-03-10 17:31:59,676 INFO L226 Difference]: Without dead ends: 2194 [2021-03-10 17:31:59,676 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 283.1ms TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:31:59,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2021-03-10 17:31:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1830. [2021-03-10 17:31:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1829 states have (on average 2.989611809732094) internal successors, (5468), 1829 states have internal predecessors, (5468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 5468 transitions. [2021-03-10 17:31:59,707 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 5468 transitions. Word has length 68 [2021-03-10 17:31:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:59,707 INFO L480 AbstractCegarLoop]: Abstraction has 1830 states and 5468 transitions. [2021-03-10 17:31:59,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 5468 transitions. [2021-03-10 17:31:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-03-10 17:31:59,710 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:59,710 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:59,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-10 17:31:59,710 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:59,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2765265, now seen corresponding path program 1 times [2021-03-10 17:31:59,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:59,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998055970] [2021-03-10 17:31:59,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:59,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998055970] [2021-03-10 17:31:59,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:59,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 17:31:59,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154640273] [2021-03-10 17:31:59,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 17:31:59,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:59,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 17:31:59,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 17:31:59,795 INFO L87 Difference]: Start difference. First operand 1830 states and 5468 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:59,933 INFO L93 Difference]: Finished difference Result 1452 states and 4163 transitions. [2021-03-10 17:31:59,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:31:59,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-03-10 17:31:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:59,935 INFO L225 Difference]: With dead ends: 1452 [2021-03-10 17:31:59,935 INFO L226 Difference]: Without dead ends: 740 [2021-03-10 17:31:59,935 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 109.8ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:31:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-03-10 17:31:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2021-03-10 17:31:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 2.7307171853856564) internal successors, (2018), 739 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2018 transitions. [2021-03-10 17:31:59,945 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2018 transitions. Word has length 68 [2021-03-10 17:31:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:59,945 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 2018 transitions. [2021-03-10 17:31:59,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2018 transitions. [2021-03-10 17:31:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-03-10 17:31:59,946 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:59,946 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-10 17:31:59,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-10 17:31:59,946 INFO L428 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash -421554612, now seen corresponding path program 1 times [2021-03-10 17:31:59,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:59,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399222809] [2021-03-10 17:31:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:31:59,972 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:32:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:32:00,005 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:32:00,049 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-10 17:32:00,049 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-10 17:32:00,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-10 17:32:00,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.03 05:32:00 BasicIcfg [2021-03-10 17:32:00,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-10 17:32:00,193 INFO L168 Benchmark]: Toolchain (without parser) took 20527.24 ms. Allocated memory was 367.0 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 330.0 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 884.3 MB. Max. memory is 16.0 GB. [2021-03-10 17:32:00,193 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 367.0 MB. Free memory was 348.5 MB in the beginning and 348.4 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 17:32:00,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.62 ms. Allocated memory is still 367.0 MB. Free memory was 329.3 MB in the beginning and 325.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-10 17:32:00,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.11 ms. Allocated memory is still 367.0 MB. Free memory was 324.7 MB in the beginning and 322.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:32:00,193 INFO L168 Benchmark]: Boogie Preprocessor took 59.74 ms. Allocated memory is still 367.0 MB. Free memory was 322.6 MB in the beginning and 320.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:32:00,194 INFO L168 Benchmark]: RCFGBuilder took 1771.01 ms. Allocated memory is still 367.0 MB. Free memory was 320.5 MB in the beginning and 286.7 MB in the end (delta: 33.8 MB). Peak memory consumption was 172.3 MB. Max. memory is 16.0 GB. [2021-03-10 17:32:00,194 INFO L168 Benchmark]: TraceAbstraction took 18094.94 ms. Allocated memory was 367.0 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 286.7 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 838.9 MB. Max. memory is 16.0 GB. [2021-03-10 17:32:00,194 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.16 ms. Allocated memory is still 367.0 MB. Free memory was 348.5 MB in the beginning and 348.4 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 513.62 ms. Allocated memory is still 367.0 MB. Free memory was 329.3 MB in the beginning and 325.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 80.11 ms. Allocated memory is still 367.0 MB. Free memory was 324.7 MB in the beginning and 322.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 59.74 ms. Allocated memory is still 367.0 MB. Free memory was 322.6 MB in the beginning and 320.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1771.01 ms. Allocated memory is still 367.0 MB. Free memory was 320.5 MB in the beginning and 286.7 MB in the end (delta: 33.8 MB). Peak memory consumption was 172.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18094.94 ms. Allocated memory was 367.0 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 286.7 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 838.9 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_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] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_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] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_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] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L813] 0 pthread_t t2192; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L814] FCALL, FORK 0 pthread_create(&t2192, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L815] 0 pthread_t t2193; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L816] FCALL, FORK 0 pthread_create(&t2193, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L817] 0 pthread_t t2194; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L818] FCALL, FORK 0 pthread_create(&t2194, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L788] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L754] 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) [L754] 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) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 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 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 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 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L824] 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) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] 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) [L824] 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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 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 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L835] 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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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)) [L841] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17860.1ms, OverallIterations: 27, TraceHistogramMax: 1, EmptinessCheckTime: 284.8ms, AutomataDifference: 8176.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 672.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3145 SDtfs, 5428 SDslu, 14061 SDs, 0 SdLazy, 2627 SolverSat, 511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2723.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 6027.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=13428occurred in iteration=0, InterpolantAutomatonStates: 316, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2890.8ms AutomataMinimizationTime, 26 MinimizatonAttempts, 3951 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 83.6ms SsaConstructionTime, 807.1ms SatisfiabilityAnalysisTime, 4562.7ms InterpolantComputationTime, 1713 NumberOfCodeBlocks, 1713 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1616 ConstructedInterpolants, 0 QuantifiedInterpolants, 10694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...