/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/mix047_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-04 23:59:54,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-04 23:59:54,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-04 23:59:54,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-04 23:59:54,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-04 23:59:54,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-04 23:59:54,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-04 23:59:54,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-04 23:59:54,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-04 23:59:54,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-04 23:59:54,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-04 23:59:54,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-04 23:59:54,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-04 23:59:54,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-04 23:59:54,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-04 23:59:54,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-04 23:59:54,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-04 23:59:54,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-04 23:59:54,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-04 23:59:54,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-04 23:59:54,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-04 23:59:54,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-04 23:59:54,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-04 23:59:54,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-04 23:59:54,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-04 23:59:54,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-04 23:59:54,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-04 23:59:54,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-04 23:59:54,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-04 23:59:54,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-04 23:59:54,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-04 23:59:54,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-04 23:59:54,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-04 23:59:54,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-04 23:59:54,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-04 23:59:54,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-04 23:59:54,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-04 23:59:54,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-04 23:59:54,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-04 23:59:54,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-04 23:59:54,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-04 23:59:54,429 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-06-04 23:59:54,443 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-04 23:59:54,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-04 23:59:54,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-04 23:59:54,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-04 23:59:54,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-04 23:59:54,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-04 23:59:54,445 INFO L138 SettingsManager]: * Use SBE=true [2021-06-04 23:59:54,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-04 23:59:54,445 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-04 23:59:54,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-04 23:59:54,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-04 23:59:54,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-04 23:59:54,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-04 23:59:54,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-04 23:59:54,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-04 23:59:54,446 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-04 23:59:54,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-04 23:59:54,446 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-04 23:59:54,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-04 23:59:54,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-04 23:59:54,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-04 23:59:54,446 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-04 23:59:54,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-04 23:59:54,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-04 23:59:54,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-04 23:59:54,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-04 23:59:54,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-04 23:59:54,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-04 23:59:54,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-04 23:59:54,447 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-04 23:59:54,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-04 23:59:54,447 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-06-04 23:59:54,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-04 23:59:54,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-04 23:59:54,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-04 23:59:54,680 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-04 23:59:54,682 INFO L275 PluginConnector]: CDTParser initialized [2021-06-04 23:59:54,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i [2021-06-04 23:59:54,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3c8ddc1/3d1e4ffd18e7467880003a743782fb7e/FLAG4b94438d2 [2021-06-04 23:59:55,151 INFO L306 CDTParser]: Found 1 translation units. [2021-06-04 23:59:55,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i [2021-06-04 23:59:55,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3c8ddc1/3d1e4ffd18e7467880003a743782fb7e/FLAG4b94438d2 [2021-06-04 23:59:55,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3c8ddc1/3d1e4ffd18e7467880003a743782fb7e [2021-06-04 23:59:55,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-04 23:59:55,511 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-04 23:59:55,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-04 23:59:55,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-04 23:59:55,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-04 23:59:55,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7154b5a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55, skipping insertion in model container [2021-06-04 23:59:55,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-04 23:59:55,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-04 23:59:55,682 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i[948,961] [2021-06-04 23:59:55,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 23:59:55,821 INFO L203 MainTranslator]: Completed pre-run [2021-06-04 23:59:55,829 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i[948,961] [2021-06-04 23:59:55,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 23:59:55,910 INFO L208 MainTranslator]: Completed translation [2021-06-04 23:59:55,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55 WrapperNode [2021-06-04 23:59:55,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-04 23:59:55,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-04 23:59:55,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-04 23:59:55,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-04 23:59:55,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-04 23:59:55,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-04 23:59:55,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-04 23:59:55,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-04 23:59:55,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (1/1) ... [2021-06-04 23:59:55,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-04 23:59:55,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-04 23:59:55,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-04 23:59:55,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-04 23:59:55,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (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-06-04 23:59:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-04 23:59:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-04 23:59:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-04 23:59:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-04 23:59:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-04 23:59:56,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-04 23:59:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-04 23:59:56,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-04 23:59:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-04 23:59:56,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-04 23:59:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-04 23:59:56,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-04 23:59:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-04 23:59:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-04 23:59:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-04 23:59:56,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-04 23:59:56,043 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-04 23:59:57,275 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-04 23:59:57,275 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-04 23:59:57,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 11:59:57 BoogieIcfgContainer [2021-06-04 23:59:57,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-04 23:59:57,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-04 23:59:57,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-04 23:59:57,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-04 23:59:57,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 11:59:55" (1/3) ... [2021-06-04 23:59:57,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45aa2664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 11:59:57, skipping insertion in model container [2021-06-04 23:59:57,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:59:55" (2/3) ... [2021-06-04 23:59:57,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45aa2664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 11:59:57, skipping insertion in model container [2021-06-04 23:59:57,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 11:59:57" (3/3) ... [2021-06-04 23:59:57,282 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_tso.opt.i [2021-06-04 23:59:57,288 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-04 23:59:57,288 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-04 23:59:57,288 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-04 23:59:57,288 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-04 23:59:57,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,317 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,317 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,317 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,317 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,319 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,320 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,320 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,320 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,320 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,323 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,323 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,323 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,323 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,324 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,324 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,324 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,324 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,329 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,329 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,334 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,334 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,336 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,340 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,340 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,341 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,341 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:59:57,342 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-04 23:59:57,357 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-04 23:59:57,368 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-04 23:59:57,368 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-04 23:59:57,368 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-04 23:59:57,368 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-04 23:59:57,368 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-04 23:59:57,368 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-04 23:59:57,368 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-04 23:59:57,368 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-04 23:59:57,375 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow [2021-06-05 00:00:24,920 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 128228 states, 128224 states have (on average 4.5057087596705765) internal successors, (577740), 128227 states have internal predecessors, (577740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 128228 states, 128224 states have (on average 4.5057087596705765) internal successors, (577740), 128227 states have internal predecessors, (577740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 00:00:25,276 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:25,277 INFO L521 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] [2021-06-05 00:00:25,277 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:25,281 INFO L82 PathProgramCache]: Analyzing trace with hash 469574097, now seen corresponding path program 1 times [2021-06-05 00:00:25,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:25,304 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895960077] [2021-06-05 00:00:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:00:25,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:25,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895960077] [2021-06-05 00:00:25,618 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895960077] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:25,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:25,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 00:00:25,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661757592] [2021-06-05 00:00:25,622 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 00:00:25,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:25,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 00:00:25,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 00:00:25,817 INFO L87 Difference]: Start difference. First operand has 128228 states, 128224 states have (on average 4.5057087596705765) internal successors, (577740), 128227 states have internal predecessors, (577740), 0 states have call successors, (0), 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 33.5) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:27,150 INFO L93 Difference]: Finished difference Result 112940 states and 499739 transitions. [2021-06-05 00:00:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 00:00:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-06-05 00:00:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:27,753 INFO L225 Difference]: With dead ends: 112940 [2021-06-05 00:00:27,754 INFO L226 Difference]: Without dead ends: 61980 [2021-06-05 00:00:27,754 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 00:00:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61980 states. [2021-06-05 00:00:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61980 to 61980. [2021-06-05 00:00:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61980 states, 61979 states have (on average 4.371884025234354) internal successors, (270965), 61979 states have internal predecessors, (270965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61980 states to 61980 states and 270965 transitions. [2021-06-05 00:00:30,514 INFO L78 Accepts]: Start accepts. Automaton has 61980 states and 270965 transitions. Word has length 67 [2021-06-05 00:00:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:00:30,516 INFO L482 AbstractCegarLoop]: Abstraction has 61980 states and 270965 transitions. [2021-06-05 00:00:30,516 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 61980 states and 270965 transitions. [2021-06-05 00:00:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 00:00:30,562 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:30,562 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:00:30,562 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 00:00:30,562 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:30,565 INFO L82 PathProgramCache]: Analyzing trace with hash -988087535, now seen corresponding path program 1 times [2021-06-05 00:00:30,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:30,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65875943] [2021-06-05 00:00:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:00:30,745 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:30,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65875943] [2021-06-05 00:00:30,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65875943] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:30,745 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:30,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:00:30,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274644872] [2021-06-05 00:00:30,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:00:30,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:30,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:00:30,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:00:30,747 INFO L87 Difference]: Start difference. First operand 61980 states and 270965 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:31,432 INFO L93 Difference]: Finished difference Result 68252 states and 295829 transitions. [2021-06-05 00:00:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:00:31,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 00:00:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:31,828 INFO L225 Difference]: With dead ends: 68252 [2021-06-05 00:00:31,828 INFO L226 Difference]: Without dead ends: 52572 [2021-06-05 00:00:31,829 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:00:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52572 states. [2021-06-05 00:00:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52572 to 52572. [2021-06-05 00:00:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52572 states, 52571 states have (on average 4.332978257974929) internal successors, (227789), 52571 states have internal predecessors, (227789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52572 states to 52572 states and 227789 transitions. [2021-06-05 00:00:33,357 INFO L78 Accepts]: Start accepts. Automaton has 52572 states and 227789 transitions. Word has length 79 [2021-06-05 00:00:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:00:33,358 INFO L482 AbstractCegarLoop]: Abstraction has 52572 states and 227789 transitions. [2021-06-05 00:00:33,358 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 52572 states and 227789 transitions. [2021-06-05 00:00:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 00:00:33,425 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:33,425 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:00:33,425 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 00:00:33,426 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash 780855984, now seen corresponding path program 1 times [2021-06-05 00:00:33,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:33,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117523854] [2021-06-05 00:00:33,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:33,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-06-05 00:00:33,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:33,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117523854] [2021-06-05 00:00:33,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117523854] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:33,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:33,857 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:00:33,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820377036] [2021-06-05 00:00:33,858 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:00:33,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:33,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:00:33,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:00:33,861 INFO L87 Difference]: Start difference. First operand 52572 states and 227789 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:34,292 INFO L93 Difference]: Finished difference Result 60252 states and 259197 transitions. [2021-06-05 00:00:34,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:00:34,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-06-05 00:00:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:34,782 INFO L225 Difference]: With dead ends: 60252 [2021-06-05 00:00:34,782 INFO L226 Difference]: Without dead ends: 50844 [2021-06-05 00:00:34,783 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 75.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:00:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50844 states. [2021-06-05 00:00:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50844 to 50844. [2021-06-05 00:00:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50844 states, 50843 states have (on average 4.320221072714041) internal successors, (219653), 50843 states have internal predecessors, (219653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50844 states to 50844 states and 219653 transitions. [2021-06-05 00:00:36,647 INFO L78 Accepts]: Start accepts. Automaton has 50844 states and 219653 transitions. Word has length 83 [2021-06-05 00:00:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:00:36,648 INFO L482 AbstractCegarLoop]: Abstraction has 50844 states and 219653 transitions. [2021-06-05 00:00:36,648 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 50844 states and 219653 transitions. [2021-06-05 00:00:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 00:00:36,731 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:36,731 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:00:36,731 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 00:00:36,731 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:36,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash 507070607, now seen corresponding path program 1 times [2021-06-05 00:00:36,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:36,732 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398853424] [2021-06-05 00:00:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:00:36,885 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:36,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398853424] [2021-06-05 00:00:36,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398853424] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:36,886 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:36,886 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:00:36,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729171673] [2021-06-05 00:00:36,887 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:00:36,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:36,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:00:36,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:00:36,888 INFO L87 Difference]: Start difference. First operand 50844 states and 219653 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:37,366 INFO L93 Difference]: Finished difference Result 58020 states and 248949 transitions. [2021-06-05 00:00:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:00:37,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-06-05 00:00:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:37,545 INFO L225 Difference]: With dead ends: 58020 [2021-06-05 00:00:37,545 INFO L226 Difference]: Without dead ends: 49764 [2021-06-05 00:00:37,545 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 136.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:00:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49764 states. [2021-06-05 00:00:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49764 to 49764. [2021-06-05 00:00:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49764 states, 49763 states have (on average 4.313425637521854) internal successors, (214649), 49763 states have internal predecessors, (214649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49764 states to 49764 states and 214649 transitions. [2021-06-05 00:00:39,270 INFO L78 Accepts]: Start accepts. Automaton has 49764 states and 214649 transitions. Word has length 85 [2021-06-05 00:00:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:00:39,270 INFO L482 AbstractCegarLoop]: Abstraction has 49764 states and 214649 transitions. [2021-06-05 00:00:39,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 49764 states and 214649 transitions. [2021-06-05 00:00:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 00:00:39,343 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:39,344 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:00:39,344 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 00:00:39,344 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:39,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:39,344 INFO L82 PathProgramCache]: Analyzing trace with hash -841553371, now seen corresponding path program 1 times [2021-06-05 00:00:39,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:39,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283088330] [2021-06-05 00:00:39,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:00:39,421 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:39,421 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283088330] [2021-06-05 00:00:39,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283088330] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:39,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:39,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:00:39,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623285726] [2021-06-05 00:00:39,422 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:00:39,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:39,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:00:39,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:00:39,422 INFO L87 Difference]: Start difference. First operand 49764 states and 214649 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:40,184 INFO L93 Difference]: Finished difference Result 79500 states and 337955 transitions. [2021-06-05 00:00:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:00:40,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 00:00:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:40,398 INFO L225 Difference]: With dead ends: 79500 [2021-06-05 00:00:40,398 INFO L226 Difference]: Without dead ends: 53796 [2021-06-05 00:00:40,398 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:00:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53796 states. [2021-06-05 00:00:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53796 to 47748. [2021-06-05 00:00:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47748 states, 47747 states have (on average 4.222736507005676) internal successors, (201623), 47747 states have internal predecessors, (201623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47748 states to 47748 states and 201623 transitions. [2021-06-05 00:00:42,019 INFO L78 Accepts]: Start accepts. Automaton has 47748 states and 201623 transitions. Word has length 86 [2021-06-05 00:00:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:00:42,020 INFO L482 AbstractCegarLoop]: Abstraction has 47748 states and 201623 transitions. [2021-06-05 00:00:42,020 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:42,020 INFO L276 IsEmpty]: Start isEmpty. Operand 47748 states and 201623 transitions. [2021-06-05 00:00:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 00:00:42,471 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:42,471 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:00:42,471 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 00:00:42,471 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:42,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2022519278, now seen corresponding path program 1 times [2021-06-05 00:00:42,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:42,472 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558725904] [2021-06-05 00:00:42,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:00:42,900 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:42,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558725904] [2021-06-05 00:00:42,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558725904] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:42,901 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:42,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 00:00:42,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565559914] [2021-06-05 00:00:42,901 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 00:00:42,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:42,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 00:00:42,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 00:00:42,902 INFO L87 Difference]: Start difference. First operand 47748 states and 201623 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:43,518 INFO L93 Difference]: Finished difference Result 56292 states and 237151 transitions. [2021-06-05 00:00:43,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 00:00:43,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-06-05 00:00:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:43,678 INFO L225 Difference]: With dead ends: 56292 [2021-06-05 00:00:43,679 INFO L226 Difference]: Without dead ends: 50100 [2021-06-05 00:00:43,679 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 346.1ms TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-06-05 00:00:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50100 states. [2021-06-05 00:00:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50100 to 50100. [2021-06-05 00:00:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50100 states, 50099 states have (on average 4.224575340825166) internal successors, (211647), 50099 states have internal predecessors, (211647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50100 states to 50100 states and 211647 transitions. [2021-06-05 00:00:45,565 INFO L78 Accepts]: Start accepts. Automaton has 50100 states and 211647 transitions. Word has length 87 [2021-06-05 00:00:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:00:45,566 INFO L482 AbstractCegarLoop]: Abstraction has 50100 states and 211647 transitions. [2021-06-05 00:00:45,566 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50100 states and 211647 transitions. [2021-06-05 00:00:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 00:00:45,652 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:45,652 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:00:45,652 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 00:00:45,652 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:45,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1321544502, now seen corresponding path program 2 times [2021-06-05 00:00:45,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:45,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877626280] [2021-06-05 00:00:45,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:00:45,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:45,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877626280] [2021-06-05 00:00:45,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877626280] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:45,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:45,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 00:00:45,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234101239] [2021-06-05 00:00:45,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 00:00:45,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:45,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 00:00:45,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 00:00:45,828 INFO L87 Difference]: Start difference. First operand 50100 states and 211647 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:46,251 INFO L93 Difference]: Finished difference Result 55776 states and 234653 transitions. [2021-06-05 00:00:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 00:00:46,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-06-05 00:00:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:46,410 INFO L225 Difference]: With dead ends: 55776 [2021-06-05 00:00:46,410 INFO L226 Difference]: Without dead ends: 49584 [2021-06-05 00:00:46,410 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 132.3ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 00:00:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49584 states. [2021-06-05 00:00:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49584 to 49584. [2021-06-05 00:00:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49584 states, 49583 states have (on average 4.219893915253212) internal successors, (209235), 49583 states have internal predecessors, (209235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49584 states to 49584 states and 209235 transitions. [2021-06-05 00:00:48,437 INFO L78 Accepts]: Start accepts. Automaton has 49584 states and 209235 transitions. Word has length 87 [2021-06-05 00:00:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:00:48,437 INFO L482 AbstractCegarLoop]: Abstraction has 49584 states and 209235 transitions. [2021-06-05 00:00:48,437 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 49584 states and 209235 transitions. [2021-06-05 00:00:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 00:00:48,523 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:48,523 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:00:48,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 00:00:48,524 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:48,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:48,524 INFO L82 PathProgramCache]: Analyzing trace with hash 55619806, now seen corresponding path program 1 times [2021-06-05 00:00:48,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:48,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85002983] [2021-06-05 00:00:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:00:48,659 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:48,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85002983] [2021-06-05 00:00:48,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85002983] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:48,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:48,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 00:00:48,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259442224] [2021-06-05 00:00:48,660 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 00:00:48,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:48,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 00:00:48,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 00:00:48,662 INFO L87 Difference]: Start difference. First operand 49584 states and 209235 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:49,150 INFO L93 Difference]: Finished difference Result 55038 states and 231309 transitions. [2021-06-05 00:00:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 00:00:49,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-06-05 00:00:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:49,309 INFO L225 Difference]: With dead ends: 55038 [2021-06-05 00:00:49,309 INFO L226 Difference]: Without dead ends: 49878 [2021-06-05 00:00:49,310 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 138.4ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 00:00:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49878 states. [2021-06-05 00:00:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49878 to 48114. [2021-06-05 00:00:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48114 states, 48113 states have (on average 4.207116579718579) internal successors, (202417), 48113 states have internal predecessors, (202417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48114 states to 48114 states and 202417 transitions. [2021-06-05 00:00:50,748 INFO L78 Accepts]: Start accepts. Automaton has 48114 states and 202417 transitions. Word has length 88 [2021-06-05 00:00:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:00:50,748 INFO L482 AbstractCegarLoop]: Abstraction has 48114 states and 202417 transitions. [2021-06-05 00:00:50,749 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 48114 states and 202417 transitions. [2021-06-05 00:00:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 00:00:51,140 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:51,140 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:00:51,140 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 00:00:51,140 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -645354970, now seen corresponding path program 2 times [2021-06-05 00:00:51,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:51,141 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159821474] [2021-06-05 00:00:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:00:51,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:51,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159821474] [2021-06-05 00:00:51,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159821474] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:51,309 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:51,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 00:00:51,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539108402] [2021-06-05 00:00:51,310 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 00:00:51,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:51,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 00:00:51,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 00:00:51,310 INFO L87 Difference]: Start difference. First operand 48114 states and 202417 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:51,778 INFO L93 Difference]: Finished difference Result 56242 states and 235894 transitions. [2021-06-05 00:00:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 00:00:51,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-06-05 00:00:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:51,926 INFO L225 Difference]: With dead ends: 56242 [2021-06-05 00:00:51,926 INFO L226 Difference]: Without dead ends: 50394 [2021-06-05 00:00:51,927 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 131.1ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-06-05 00:00:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50394 states. [2021-06-05 00:00:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50394 to 48480. [2021-06-05 00:00:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48480 states, 48479 states have (on average 4.212669403246767) internal successors, (204226), 48479 states have internal predecessors, (204226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48480 states to 48480 states and 204226 transitions. [2021-06-05 00:00:53,513 INFO L78 Accepts]: Start accepts. Automaton has 48480 states and 204226 transitions. Word has length 88 [2021-06-05 00:00:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:00:53,513 INFO L482 AbstractCegarLoop]: Abstraction has 48480 states and 204226 transitions. [2021-06-05 00:00:53,513 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 48480 states and 204226 transitions. [2021-06-05 00:00:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 00:00:53,607 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:53,608 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:00:53,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 00:00:53,608 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:53,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:53,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1043458227, now seen corresponding path program 1 times [2021-06-05 00:00:53,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:53,611 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788094923] [2021-06-05 00:00:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:00:53,846 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:53,846 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788094923] [2021-06-05 00:00:53,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788094923] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:53,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:53,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 00:00:53,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077982525] [2021-06-05 00:00:53,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 00:00:53,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 00:00:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-06-05 00:00:53,847 INFO L87 Difference]: Start difference. First operand 48480 states and 204226 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:54,667 INFO L93 Difference]: Finished difference Result 61918 states and 260342 transitions. [2021-06-05 00:00:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 00:00:54,667 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-06-05 00:00:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:54,845 INFO L225 Difference]: With dead ends: 61918 [2021-06-05 00:00:54,845 INFO L226 Difference]: Without dead ends: 57790 [2021-06-05 00:00:54,845 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 228.5ms TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-06-05 00:00:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57790 states. [2021-06-05 00:00:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57790 to 57790. [2021-06-05 00:00:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57790 states, 57789 states have (on average 4.212808666009102) internal successors, (243454), 57789 states have internal predecessors, (243454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57790 states to 57790 states and 243454 transitions. [2021-06-05 00:00:56,471 INFO L78 Accepts]: Start accepts. Automaton has 57790 states and 243454 transitions. Word has length 89 [2021-06-05 00:00:56,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:00:56,472 INFO L482 AbstractCegarLoop]: Abstraction has 57790 states and 243454 transitions. [2021-06-05 00:00:56,472 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 57790 states and 243454 transitions. [2021-06-05 00:00:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 00:00:56,564 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:00:56,564 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:00:56,564 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 00:00:56,565 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:00:56,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:00:56,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1744433003, now seen corresponding path program 2 times [2021-06-05 00:00:56,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:00:56,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593666801] [2021-06-05 00:00:56,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:00:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:00:56,945 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2021-06-05 00:00:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:00:57,152 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:00:57,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593666801] [2021-06-05 00:00:57,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593666801] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:00:57,152 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:00:57,152 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 00:00:57,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888423954] [2021-06-05 00:00:57,153 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 00:00:57,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:00:57,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 00:00:57,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-06-05 00:00:57,153 INFO L87 Difference]: Start difference. First operand 57790 states and 243454 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:00:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:00:57,790 INFO L93 Difference]: Finished difference Result 69954 states and 293354 transitions. [2021-06-05 00:00:57,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 00:00:57,791 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-06-05 00:00:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:00:57,994 INFO L225 Difference]: With dead ends: 69954 [2021-06-05 00:00:57,994 INFO L226 Difference]: Without dead ends: 65826 [2021-06-05 00:00:57,994 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 357.0ms TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2021-06-05 00:00:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65826 states. [2021-06-05 00:00:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65826 to 57398. [2021-06-05 00:00:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57398 states, 57397 states have (on average 4.218896458003032) internal successors, (242152), 57397 states have internal predecessors, (242152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57398 states to 57398 states and 242152 transitions. [2021-06-05 00:01:00,121 INFO L78 Accepts]: Start accepts. Automaton has 57398 states and 242152 transitions. Word has length 89 [2021-06-05 00:01:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:01:00,121 INFO L482 AbstractCegarLoop]: Abstraction has 57398 states and 242152 transitions. [2021-06-05 00:01:00,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 57398 states and 242152 transitions. [2021-06-05 00:01:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 00:01:00,221 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:01:00,222 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:01:00,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 00:01:00,222 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:01:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:01:00,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1168685019, now seen corresponding path program 3 times [2021-06-05 00:01:00,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:01:00,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014618269] [2021-06-05 00:01:00,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:01:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:01:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:01:00,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:01:00,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014618269] [2021-06-05 00:01:00,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014618269] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:01:00,430 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:01:00,430 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 00:01:00,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048532287] [2021-06-05 00:01:00,430 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 00:01:00,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:01:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 00:01:00,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-06-05 00:01:00,431 INFO L87 Difference]: Start difference. First operand 57398 states and 242152 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:01:01,044 INFO L93 Difference]: Finished difference Result 69562 states and 292052 transitions. [2021-06-05 00:01:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 00:01:01,044 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-06-05 00:01:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:01:01,250 INFO L225 Difference]: With dead ends: 69562 [2021-06-05 00:01:01,250 INFO L226 Difference]: Without dead ends: 65434 [2021-06-05 00:01:01,251 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 272.5ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-06-05 00:01:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65434 states. [2021-06-05 00:01:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65434 to 57300. [2021-06-05 00:01:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57300 states, 57299 states have (on average 4.220003839508543) internal successors, (241802), 57299 states have internal predecessors, (241802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57300 states to 57300 states and 241802 transitions. [2021-06-05 00:01:03,354 INFO L78 Accepts]: Start accepts. Automaton has 57300 states and 241802 transitions. Word has length 89 [2021-06-05 00:01:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:01:03,354 INFO L482 AbstractCegarLoop]: Abstraction has 57300 states and 241802 transitions. [2021-06-05 00:01:03,355 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 57300 states and 241802 transitions. [2021-06-05 00:01:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 00:01:03,456 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:01:03,456 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:01:03,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 00:01:03,456 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:01:03,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:01:03,457 INFO L82 PathProgramCache]: Analyzing trace with hash -371300851, now seen corresponding path program 4 times [2021-06-05 00:01:03,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:01:03,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887943290] [2021-06-05 00:01:03,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:01:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:01:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:01:03,668 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:01:03,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887943290] [2021-06-05 00:01:03,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887943290] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:01:03,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:01:03,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 00:01:03,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525499957] [2021-06-05 00:01:03,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 00:01:03,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:01:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 00:01:03,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-06-05 00:01:03,670 INFO L87 Difference]: Start difference. First operand 57300 states and 241802 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:01:04,270 INFO L93 Difference]: Finished difference Result 74332 states and 309928 transitions. [2021-06-05 00:01:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 00:01:04,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-06-05 00:01:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:01:04,816 INFO L225 Difference]: With dead ends: 74332 [2021-06-05 00:01:04,816 INFO L226 Difference]: Without dead ends: 58632 [2021-06-05 00:01:04,817 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 248.2ms TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-06-05 00:01:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58632 states. [2021-06-05 00:01:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58632 to 44652. [2021-06-05 00:01:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44652 states, 44651 states have (on average 4.163467783476294) internal successors, (185903), 44651 states have internal predecessors, (185903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44652 states to 44652 states and 185903 transitions. [2021-06-05 00:01:06,346 INFO L78 Accepts]: Start accepts. Automaton has 44652 states and 185903 transitions. Word has length 89 [2021-06-05 00:01:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:01:06,346 INFO L482 AbstractCegarLoop]: Abstraction has 44652 states and 185903 transitions. [2021-06-05 00:01:06,346 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 44652 states and 185903 transitions. [2021-06-05 00:01:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 00:01:06,420 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:01:06,420 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:01:06,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 00:01:06,420 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:01:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:01:06,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1627137647, now seen corresponding path program 1 times [2021-06-05 00:01:06,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:01:06,421 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437653235] [2021-06-05 00:01:06,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:01:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:01:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:01:06,504 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:01:06,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437653235] [2021-06-05 00:01:06,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437653235] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:01:06,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:01:06,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:01:06,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398713312] [2021-06-05 00:01:06,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:01:06,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:01:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:01:06,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:01:06,505 INFO L87 Difference]: Start difference. First operand 44652 states and 185903 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:01:06,835 INFO L93 Difference]: Finished difference Result 56792 states and 233371 transitions. [2021-06-05 00:01:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:01:06,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-06-05 00:01:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:01:06,942 INFO L225 Difference]: With dead ends: 56792 [2021-06-05 00:01:06,942 INFO L226 Difference]: Without dead ends: 41112 [2021-06-05 00:01:06,943 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 58.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:01:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41112 states. [2021-06-05 00:01:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41112 to 41112. [2021-06-05 00:01:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41112 states, 41111 states have (on average 4.106030016297342) internal successors, (168803), 41111 states have internal predecessors, (168803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41112 states to 41112 states and 168803 transitions. [2021-06-05 00:01:08,232 INFO L78 Accepts]: Start accepts. Automaton has 41112 states and 168803 transitions. Word has length 89 [2021-06-05 00:01:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:01:08,232 INFO L482 AbstractCegarLoop]: Abstraction has 41112 states and 168803 transitions. [2021-06-05 00:01:08,232 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 41112 states and 168803 transitions. [2021-06-05 00:01:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-06-05 00:01:08,317 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:01:08,318 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:01:08,318 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 00:01:08,318 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:01:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:01:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash -966078751, now seen corresponding path program 1 times [2021-06-05 00:01:08,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:01:08,318 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787566625] [2021-06-05 00:01:08,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:01:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:01:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:01:08,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:01:08,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787566625] [2021-06-05 00:01:08,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787566625] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:01:08,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:01:08,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 00:01:08,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949644575] [2021-06-05 00:01:08,457 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 00:01:08,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:01:08,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 00:01:08,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 00:01:08,457 INFO L87 Difference]: Start difference. First operand 41112 states and 168803 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:01:08,796 INFO L93 Difference]: Finished difference Result 44904 states and 180493 transitions. [2021-06-05 00:01:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 00:01:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-06-05 00:01:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:01:09,266 INFO L225 Difference]: With dead ends: 44904 [2021-06-05 00:01:09,266 INFO L226 Difference]: Without dead ends: 31464 [2021-06-05 00:01:09,268 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 71.6ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 00:01:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31464 states. [2021-06-05 00:01:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31464 to 31464. [2021-06-05 00:01:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31464 states, 31463 states have (on average 3.9827416330292724) internal successors, (125309), 31463 states have internal predecessors, (125309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31464 states to 31464 states and 125309 transitions. [2021-06-05 00:01:09,943 INFO L78 Accepts]: Start accepts. Automaton has 31464 states and 125309 transitions. Word has length 90 [2021-06-05 00:01:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:01:09,943 INFO L482 AbstractCegarLoop]: Abstraction has 31464 states and 125309 transitions. [2021-06-05 00:01:09,944 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 31464 states and 125309 transitions. [2021-06-05 00:01:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-05 00:01:09,996 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:01:09,996 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:01:09,996 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 00:01:09,996 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:01:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:01:09,997 INFO L82 PathProgramCache]: Analyzing trace with hash -763895198, now seen corresponding path program 1 times [2021-06-05 00:01:09,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:01:09,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764936532] [2021-06-05 00:01:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:01:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:01:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:01:10,081 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:01:10,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764936532] [2021-06-05 00:01:10,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764936532] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:01:10,082 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:01:10,082 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 00:01:10,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859112135] [2021-06-05 00:01:10,083 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 00:01:10,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:01:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 00:01:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 00:01:10,084 INFO L87 Difference]: Start difference. First operand 31464 states and 125309 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:01:10,709 INFO L93 Difference]: Finished difference Result 44088 states and 175056 transitions. [2021-06-05 00:01:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 00:01:10,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-06-05 00:01:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:01:10,770 INFO L225 Difference]: With dead ends: 44088 [2021-06-05 00:01:10,770 INFO L226 Difference]: Without dead ends: 21244 [2021-06-05 00:01:10,770 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:01:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21244 states. [2021-06-05 00:01:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21244 to 21244. [2021-06-05 00:01:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21244 states, 21243 states have (on average 3.921244645294921) internal successors, (83299), 21243 states have internal predecessors, (83299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21244 states to 21244 states and 83299 transitions. [2021-06-05 00:01:11,241 INFO L78 Accepts]: Start accepts. Automaton has 21244 states and 83299 transitions. Word has length 92 [2021-06-05 00:01:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:01:11,241 INFO L482 AbstractCegarLoop]: Abstraction has 21244 states and 83299 transitions. [2021-06-05 00:01:11,241 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 21244 states and 83299 transitions. [2021-06-05 00:01:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-05 00:01:11,277 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:01:11,277 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:01:11,277 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 00:01:11,277 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:01:11,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:01:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1572982882, now seen corresponding path program 2 times [2021-06-05 00:01:11,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:01:11,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293913234] [2021-06-05 00:01:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:01:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:01:11,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-06-05 00:01:11,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:01:11,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293913234] [2021-06-05 00:01:11,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293913234] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:01:11,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:01:11,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:01:11,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081945201] [2021-06-05 00:01:11,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:01:11,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:01:11,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:01:11,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:01:11,335 INFO L87 Difference]: Start difference. First operand 21244 states and 83299 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:01:11,528 INFO L93 Difference]: Finished difference Result 32320 states and 125621 transitions. [2021-06-05 00:01:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:01:11,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-06-05 00:01:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:01:11,580 INFO L225 Difference]: With dead ends: 32320 [2021-06-05 00:01:11,580 INFO L226 Difference]: Without dead ends: 22288 [2021-06-05 00:01:11,581 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:01:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22288 states. [2021-06-05 00:01:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22288 to 20344. [2021-06-05 00:01:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20344 states, 20343 states have (on average 3.846974389224795) internal successors, (78259), 20343 states have internal predecessors, (78259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20344 states to 20344 states and 78259 transitions. [2021-06-05 00:01:12,263 INFO L78 Accepts]: Start accepts. Automaton has 20344 states and 78259 transitions. Word has length 92 [2021-06-05 00:01:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:01:12,263 INFO L482 AbstractCegarLoop]: Abstraction has 20344 states and 78259 transitions. [2021-06-05 00:01:12,264 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 20344 states and 78259 transitions. [2021-06-05 00:01:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-05 00:01:12,291 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:01:12,291 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:01:12,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 00:01:12,292 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:01:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:01:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1065422082, now seen corresponding path program 1 times [2021-06-05 00:01:12,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:01:12,292 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598243989] [2021-06-05 00:01:12,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:01:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:01:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:01:12,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:01:12,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598243989] [2021-06-05 00:01:12,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598243989] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:01:12,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:01:12,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 00:01:12,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083024013] [2021-06-05 00:01:12,357 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 00:01:12,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:01:12,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 00:01:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 00:01:12,358 INFO L87 Difference]: Start difference. First operand 20344 states and 78259 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:01:12,543 INFO L93 Difference]: Finished difference Result 18742 states and 70327 transitions. [2021-06-05 00:01:12,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 00:01:12,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-06-05 00:01:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:01:12,571 INFO L225 Difference]: With dead ends: 18742 [2021-06-05 00:01:12,571 INFO L226 Difference]: Without dead ends: 12268 [2021-06-05 00:01:12,571 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 83.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 00:01:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12268 states. [2021-06-05 00:01:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12268 to 12268. [2021-06-05 00:01:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12268 states, 12267 states have (on average 3.7046547648161736) internal successors, (45445), 12267 states have internal predecessors, (45445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12268 states to 12268 states and 45445 transitions. [2021-06-05 00:01:12,798 INFO L78 Accepts]: Start accepts. Automaton has 12268 states and 45445 transitions. Word has length 92 [2021-06-05 00:01:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:01:12,798 INFO L482 AbstractCegarLoop]: Abstraction has 12268 states and 45445 transitions. [2021-06-05 00:01:12,799 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 12268 states and 45445 transitions. [2021-06-05 00:01:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 00:01:12,815 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:01:12,816 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:01:12,816 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 00:01:12,816 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:01:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:01:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1828217073, now seen corresponding path program 1 times [2021-06-05 00:01:12,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:01:12,816 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401852561] [2021-06-05 00:01:12,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:01:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:01:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:01:12,890 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:01:12,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401852561] [2021-06-05 00:01:12,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401852561] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:01:12,890 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:01:12,890 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 00:01:12,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236917224] [2021-06-05 00:01:12,891 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 00:01:12,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:01:12,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 00:01:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 00:01:12,891 INFO L87 Difference]: Start difference. First operand 12268 states and 45445 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:01:13,056 INFO L93 Difference]: Finished difference Result 10162 states and 36994 transitions. [2021-06-05 00:01:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 00:01:13,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-06-05 00:01:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:01:13,061 INFO L225 Difference]: With dead ends: 10162 [2021-06-05 00:01:13,061 INFO L226 Difference]: Without dead ends: 2686 [2021-06-05 00:01:13,062 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-05 00:01:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2021-06-05 00:01:13,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2021-06-05 00:01:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2685 states have (on average 3.533333333333333) internal successors, (9487), 2685 states have internal predecessors, (9487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 9487 transitions. [2021-06-05 00:01:13,100 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 9487 transitions. Word has length 95 [2021-06-05 00:01:13,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:01:13,100 INFO L482 AbstractCegarLoop]: Abstraction has 2686 states and 9487 transitions. [2021-06-05 00:01:13,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:01:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 9487 transitions. [2021-06-05 00:01:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 00:01:13,104 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:01:13,104 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:01:13,104 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 00:01:13,104 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:01:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:01:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash -534616835, now seen corresponding path program 1 times [2021-06-05 00:01:13,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:01:13,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288587782] [2021-06-05 00:01:13,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:01:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 00:01:13,127 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 00:01:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 00:01:13,154 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 00:01:13,192 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 00:01:13,192 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 00:01:13,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 00:01:13,194 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 00:01:13,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:01:13 BasicIcfg [2021-06-05 00:01:13,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 00:01:13,312 INFO L168 Benchmark]: Toolchain (without parser) took 77800.20 ms. Allocated memory was 360.7 MB in the beginning and 15.2 GB in the end (delta: 14.9 GB). Free memory was 323.9 MB in the beginning and 8.0 GB in the end (delta: -7.7 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB. [2021-06-05 00:01:13,312 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 360.7 MB. Free memory was 342.0 MB in the beginning and 341.9 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 00:01:13,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.60 ms. Allocated memory is still 360.7 MB. Free memory was 323.7 MB in the beginning and 321.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.0 GB. [2021-06-05 00:01:13,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.01 ms. Allocated memory is still 360.7 MB. Free memory was 321.8 MB in the beginning and 318.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 00:01:13,312 INFO L168 Benchmark]: Boogie Preprocessor took 37.19 ms. Allocated memory is still 360.7 MB. Free memory was 318.6 MB in the beginning and 316.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 00:01:13,312 INFO L168 Benchmark]: RCFGBuilder took 1286.77 ms. Allocated memory is still 360.7 MB. Free memory was 316.5 MB in the beginning and 277.9 MB in the end (delta: 38.6 MB). Peak memory consumption was 149.7 MB. Max. memory is 16.0 GB. [2021-06-05 00:01:13,313 INFO L168 Benchmark]: TraceAbstraction took 76032.70 ms. Allocated memory was 360.7 MB in the beginning and 15.2 GB in the end (delta: 14.9 GB). Free memory was 276.9 MB in the beginning and 8.0 GB in the end (delta: -7.7 GB). Peak memory consumption was 7.1 GB. Max. memory is 16.0 GB. [2021-06-05 00:01:13,315 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.13 ms. Allocated memory is still 360.7 MB. Free memory was 342.0 MB in the beginning and 341.9 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 383.60 ms. Allocated memory is still 360.7 MB. Free memory was 323.7 MB in the beginning and 321.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 37.01 ms. Allocated memory is still 360.7 MB. Free memory was 321.8 MB in the beginning and 318.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 37.19 ms. Allocated memory is still 360.7 MB. Free memory was 318.6 MB in the beginning and 316.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1286.77 ms. Allocated memory is still 360.7 MB. Free memory was 316.5 MB in the beginning and 277.9 MB in the end (delta: 38.6 MB). Peak memory consumption was 149.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 76032.70 ms. Allocated memory was 360.7 MB in the beginning and 15.2 GB in the end (delta: 14.9 GB). Free memory was 276.9 MB in the beginning and 8.0 GB in the end (delta: -7.7 GB). Peak memory consumption was 7.1 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L718] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 pthread_t t1277; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1277, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1278; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1278, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1279; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1279, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1280; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1280, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 75826.0ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 2319.4ms, AutomataDifference: 14774.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27552.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3451 SDtfs, 5252 SDslu, 13885 SDs, 0 SdLazy, 1348 SolverSat, 282 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1113.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 2677.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=128228occurred in iteration=0, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 27188.3ms AutomataMinimizationTime, 19 MinimizatonAttempts, 42212 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 79.4ms SsaConstructionTime, 538.9ms SatisfiabilityAnalysisTime, 2990.9ms InterpolantComputationTime, 1755 NumberOfCodeBlocks, 1755 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1637 ConstructedInterpolants, 0 QuantifiedInterpolants, 8696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...