/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 16:51:42,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 16:51:42,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 16:51:42,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 16:51:42,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 16:51:42,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 16:51:42,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 16:51:42,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 16:51:42,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 16:51:42,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 16:51:42,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 16:51:42,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 16:51:42,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 16:51:42,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 16:51:42,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 16:51:42,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 16:51:42,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 16:51:42,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 16:51:42,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 16:51:42,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 16:51:42,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 16:51:42,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 16:51:42,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 16:51:42,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 16:51:42,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 16:51:42,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 16:51:42,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 16:51:42,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 16:51:42,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 16:51:42,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 16:51:42,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 16:51:42,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 16:51:42,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 16:51:42,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 16:51:42,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 16:51:42,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 16:51:42,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 16:51:42,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 16:51:42,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 16:51:42,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 16:51:42,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 16:51:42,608 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-07-09 16:51:42,652 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 16:51:42,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 16:51:42,653 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 16:51:42,653 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 16:51:42,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 16:51:42,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 16:51:42,655 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 16:51:42,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 16:51:42,655 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 16:51:42,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 16:51:42,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 16:51:42,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 16:51:42,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 16:51:42,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 16:51:42,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 16:51:42,657 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 16:51:42,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 16:51:42,657 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 16:51:42,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 16:51:42,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 16:51:42,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 16:51:42,657 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 16:51:42,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 16:51:42,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:51:42,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 16:51:42,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 16:51:42,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 16:51:42,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 16:51:42,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 16:51:42,658 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 16:51:42,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 16:51:42,658 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-07-09 16:51:42,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 16:51:42,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 16:51:42,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 16:51:42,945 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 16:51:42,945 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 16:51:42,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2021-07-09 16:51:42,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f0cb9c8/fcb7ba5fd00b4cedaa548a53f7a3a477/FLAG75b87ff67 [2021-07-09 16:51:43,378 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 16:51:43,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2021-07-09 16:51:43,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f0cb9c8/fcb7ba5fd00b4cedaa548a53f7a3a477/FLAG75b87ff67 [2021-07-09 16:51:43,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f0cb9c8/fcb7ba5fd00b4cedaa548a53f7a3a477 [2021-07-09 16:51:43,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 16:51:43,797 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 16:51:43,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 16:51:43,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 16:51:43,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 16:51:43,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:51:43" (1/1) ... [2021-07-09 16:51:43,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7596072f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:43, skipping insertion in model container [2021-07-09 16:51:43,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:51:43" (1/1) ... [2021-07-09 16:51:43,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 16:51:43,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 16:51:43,957 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/safe030_pso.opt.i[949,962] [2021-07-09 16:51:44,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:51:44,170 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 16:51:44,179 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/safe030_pso.opt.i[949,962] [2021-07-09 16:51:44,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:51:44,256 INFO L208 MainTranslator]: Completed translation [2021-07-09 16:51:44,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44 WrapperNode [2021-07-09 16:51:44,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 16:51:44,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 16:51:44,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 16:51:44,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 16:51:44,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (1/1) ... [2021-07-09 16:51:44,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (1/1) ... [2021-07-09 16:51:44,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 16:51:44,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 16:51:44,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 16:51:44,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 16:51:44,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (1/1) ... [2021-07-09 16:51:44,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (1/1) ... [2021-07-09 16:51:44,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (1/1) ... [2021-07-09 16:51:44,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (1/1) ... [2021-07-09 16:51:44,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (1/1) ... [2021-07-09 16:51:44,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (1/1) ... [2021-07-09 16:51:44,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (1/1) ... [2021-07-09 16:51:44,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 16:51:44,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 16:51:44,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 16:51:44,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 16:51:44,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (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-07-09 16:51:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 16:51:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 16:51:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 16:51:44,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 16:51:44,488 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 16:51:44,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 16:51:44,489 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 16:51:44,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 16:51:44,489 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-09 16:51:44,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-09 16:51:44,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 16:51:44,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 16:51:44,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 16:51:44,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 16:51:44,491 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 16:51:45,726 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 16:51:45,726 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 16:51:45,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:51:45 BoogieIcfgContainer [2021-07-09 16:51:45,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 16:51:45,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 16:51:45,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 16:51:45,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 16:51:45,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 04:51:43" (1/3) ... [2021-07-09 16:51:45,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4f4c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:51:45, skipping insertion in model container [2021-07-09 16:51:45,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:44" (2/3) ... [2021-07-09 16:51:45,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4f4c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:51:45, skipping insertion in model container [2021-07-09 16:51:45,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:51:45" (3/3) ... [2021-07-09 16:51:45,733 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2021-07-09 16:51:45,738 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 16:51:45,738 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 16:51:45,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 16:51:45,738 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 16:51:45,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,760 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,760 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,760 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,760 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,761 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,761 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,761 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,761 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,764 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,764 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,764 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,764 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,764 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,765 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,765 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,765 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,769 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,770 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,770 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,773 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,773 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:45,774 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 16:51:45,825 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 16:51:45,838 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:51:45,839 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:51:45,839 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:51:45,839 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:51:45,839 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:51:45,839 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:51:45,839 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:51:45,839 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork0======== [2021-07-09 16:51:45,847 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-07-09 16:51:45,978 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5015 states, 5013 states have (on average 3.348294434470377) internal successors, (16785), 5014 states have internal predecessors, (16785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 5015 states, 5013 states have (on average 3.348294434470377) internal successors, (16785), 5014 states have internal predecessors, (16785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-09 16:51:46,002 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:46,003 INFO L508 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] [2021-07-09 16:51:46,003 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1699461236, now seen corresponding path program 1 times [2021-07-09 16:51:46,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:46,013 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7201980] [2021-07-09 16:51:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:46,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:46,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7201980] [2021-07-09 16:51:46,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7201980] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:46,198 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:46,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-09 16:51:46,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553945094] [2021-07-09 16:51:46,201 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 16:51:46,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:46,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 16:51:46,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:51:46,225 INFO L87 Difference]: Start difference. First operand has 5015 states, 5013 states have (on average 3.348294434470377) internal successors, (16785), 5014 states have internal predecessors, (16785), 0 states have call successors, (0), 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 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:46,283 INFO L93 Difference]: Finished difference Result 3391 states and 10500 transitions. [2021-07-09 16:51:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 16:51:46,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-07-09 16:51:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:46,289 INFO L225 Difference]: With dead ends: 3391 [2021-07-09 16:51:46,289 INFO L226 Difference]: Without dead ends: 0 [2021-07-09 16:51:46,290 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:51:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-09 16:51:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-09 16:51:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-09 16:51:46,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-07-09 16:51:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:46,304 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-09 16:51:46,304 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-09 16:51:46,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 16:51:46,305 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 16:51:46,305 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/2) [2021-07-09 16:51:46,306 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-09 16:51:46,307 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:51:46,307 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:51:46,307 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:51:46,307 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:51:46,307 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:51:46,308 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:51:46,308 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:51:46,308 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 16:51:46,309 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-07-09 16:51:46,464 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8543 states, 8541 states have (on average 3.5593021894391756) internal successors, (30400), 8542 states have internal predecessors, (30400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 8543 states, 8541 states have (on average 3.5593021894391756) internal successors, (30400), 8542 states have internal predecessors, (30400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-09 16:51:46,556 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:46,556 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:46,556 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:46,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:46,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1498850709, now seen corresponding path program 1 times [2021-07-09 16:51:46,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:46,563 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762231083] [2021-07-09 16:51:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:46,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-07-09 16:51:46,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:46,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762231083] [2021-07-09 16:51:46,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762231083] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:46,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:46,855 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:46,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820802095] [2021-07-09 16:51:46,855 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:46,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:46,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:46,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:46,871 INFO L87 Difference]: Start difference. First operand has 8543 states, 8541 states have (on average 3.5593021894391756) internal successors, (30400), 8542 states have internal predecessors, (30400), 0 states have call successors, (0), 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 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:47,053 INFO L93 Difference]: Finished difference Result 10175 states and 35268 transitions. [2021-07-09 16:51:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:47,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-07-09 16:51:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:47,103 INFO L225 Difference]: With dead ends: 10175 [2021-07-09 16:51:47,103 INFO L226 Difference]: Without dead ends: 7655 [2021-07-09 16:51:47,103 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 103.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7655 states. [2021-07-09 16:51:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7655 to 7655. [2021-07-09 16:51:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7655 states, 7653 states have (on average 3.4735397883183063) internal successors, (26583), 7654 states have internal predecessors, (26583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 26583 transitions. [2021-07-09 16:51:47,430 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 26583 transitions. Word has length 66 [2021-07-09 16:51:47,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:47,431 INFO L482 AbstractCegarLoop]: Abstraction has 7655 states and 26583 transitions. [2021-07-09 16:51:47,431 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 26583 transitions. [2021-07-09 16:51:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-09 16:51:47,442 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:47,442 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:47,442 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 16:51:47,442 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:47,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2143243498, now seen corresponding path program 1 times [2021-07-09 16:51:47,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:47,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157031057] [2021-07-09 16:51:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:47,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:47,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157031057] [2021-07-09 16:51:47,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157031057] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:47,540 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:47,540 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:47,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292528536] [2021-07-09 16:51:47,541 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:47,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:47,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:47,542 INFO L87 Difference]: Start difference. First operand 7655 states and 26583 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:47,740 INFO L93 Difference]: Finished difference Result 9187 states and 31613 transitions. [2021-07-09 16:51:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:47,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-07-09 16:51:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:47,781 INFO L225 Difference]: With dead ends: 9187 [2021-07-09 16:51:47,781 INFO L226 Difference]: Without dead ends: 7427 [2021-07-09 16:51:47,782 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 133.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7427 states. [2021-07-09 16:51:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7427 to 7427. [2021-07-09 16:51:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 7425 states have (on average 3.462222222222222) internal successors, (25707), 7426 states have internal predecessors, (25707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 25707 transitions. [2021-07-09 16:51:48,009 INFO L78 Accepts]: Start accepts. Automaton has 7427 states and 25707 transitions. Word has length 68 [2021-07-09 16:51:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:48,009 INFO L482 AbstractCegarLoop]: Abstraction has 7427 states and 25707 transitions. [2021-07-09 16:51:48,010 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7427 states and 25707 transitions. [2021-07-09 16:51:48,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-07-09 16:51:48,021 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:48,022 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:48,022 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 16:51:48,022 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:48,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1573199234, now seen corresponding path program 1 times [2021-07-09 16:51:48,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:48,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300851680] [2021-07-09 16:51:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:48,251 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:48,251 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300851680] [2021-07-09 16:51:48,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300851680] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:48,251 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:48,251 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:51:48,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613886533] [2021-07-09 16:51:48,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:51:48,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:51:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:51:48,253 INFO L87 Difference]: Start difference. First operand 7427 states and 25707 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:48,579 INFO L93 Difference]: Finished difference Result 8392 states and 28674 transitions. [2021-07-09 16:51:48,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-09 16:51:48,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-07-09 16:51:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:48,602 INFO L225 Difference]: With dead ends: 8392 [2021-07-09 16:51:48,602 INFO L226 Difference]: Without dead ends: 6836 [2021-07-09 16:51:48,603 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 244.4ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:51:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6836 states. [2021-07-09 16:51:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6836 to 6836. [2021-07-09 16:51:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 6834 states have (on average 3.435908691834943) internal successors, (23481), 6835 states have internal predecessors, (23481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 23481 transitions. [2021-07-09 16:51:48,840 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 23481 transitions. Word has length 69 [2021-07-09 16:51:48,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:48,840 INFO L482 AbstractCegarLoop]: Abstraction has 6836 states and 23481 transitions. [2021-07-09 16:51:48,841 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 23481 transitions. [2021-07-09 16:51:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 16:51:48,852 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:48,853 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:48,853 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 16:51:48,853 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash -646375001, now seen corresponding path program 1 times [2021-07-09 16:51:48,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:48,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653233471] [2021-07-09 16:51:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:49,002 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:49,002 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653233471] [2021-07-09 16:51:49,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653233471] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:49,002 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:49,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:51:49,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635910740] [2021-07-09 16:51:49,003 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:51:49,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:51:49,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:51:49,004 INFO L87 Difference]: Start difference. First operand 6836 states and 23481 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:49,306 INFO L93 Difference]: Finished difference Result 7111 states and 24186 transitions. [2021-07-09 16:51:49,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-09 16:51:49,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-07-09 16:51:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:49,323 INFO L225 Difference]: With dead ends: 7111 [2021-07-09 16:51:49,324 INFO L226 Difference]: Without dead ends: 6311 [2021-07-09 16:51:49,324 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 182.2ms TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:51:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6311 states. [2021-07-09 16:51:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6311 to 6311. [2021-07-09 16:51:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6311 states, 6310 states have (on average 3.4225039619651345) internal successors, (21596), 6310 states have internal predecessors, (21596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6311 states to 6311 states and 21596 transitions. [2021-07-09 16:51:49,440 INFO L78 Accepts]: Start accepts. Automaton has 6311 states and 21596 transitions. Word has length 71 [2021-07-09 16:51:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:49,440 INFO L482 AbstractCegarLoop]: Abstraction has 6311 states and 21596 transitions. [2021-07-09 16:51:49,440 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6311 states and 21596 transitions. [2021-07-09 16:51:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-09 16:51:49,450 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:49,450 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:49,451 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 16:51:49,451 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:49,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:49,451 INFO L82 PathProgramCache]: Analyzing trace with hash -860155308, now seen corresponding path program 1 times [2021-07-09 16:51:49,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:49,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928114546] [2021-07-09 16:51:49,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:49,725 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:49,725 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928114546] [2021-07-09 16:51:49,725 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928114546] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:49,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:49,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:51:49,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557637776] [2021-07-09 16:51:49,726 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:51:49,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:51:49,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:51:49,727 INFO L87 Difference]: Start difference. First operand 6311 states and 21596 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:50,041 INFO L93 Difference]: Finished difference Result 7171 states and 24416 transitions. [2021-07-09 16:51:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-09 16:51:50,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-09 16:51:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:50,060 INFO L225 Difference]: With dead ends: 7171 [2021-07-09 16:51:50,060 INFO L226 Difference]: Without dead ends: 6211 [2021-07-09 16:51:50,061 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 326.0ms TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:51:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6211 states. [2021-07-09 16:51:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6211 to 6099. [2021-07-09 16:51:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6099 states, 6098 states have (on average 3.4148901279107906) internal successors, (20824), 6098 states have internal predecessors, (20824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:50,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6099 states to 6099 states and 20824 transitions. [2021-07-09 16:51:50,190 INFO L78 Accepts]: Start accepts. Automaton has 6099 states and 20824 transitions. Word has length 72 [2021-07-09 16:51:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:50,191 INFO L482 AbstractCegarLoop]: Abstraction has 6099 states and 20824 transitions. [2021-07-09 16:51:50,191 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6099 states and 20824 transitions. [2021-07-09 16:51:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-09 16:51:50,205 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:50,205 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:50,205 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 16:51:50,205 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash -901660648, now seen corresponding path program 1 times [2021-07-09 16:51:50,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:50,206 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67492214] [2021-07-09 16:51:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:50,267 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:50,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67492214] [2021-07-09 16:51:50,267 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67492214] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:50,267 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:50,267 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:50,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907411649] [2021-07-09 16:51:50,268 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:50,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:50,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:50,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:50,268 INFO L87 Difference]: Start difference. First operand 6099 states and 20824 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:50,397 INFO L93 Difference]: Finished difference Result 9826 states and 33169 transitions. [2021-07-09 16:51:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:50,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-09 16:51:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:50,418 INFO L225 Difference]: With dead ends: 9826 [2021-07-09 16:51:50,418 INFO L226 Difference]: Without dead ends: 6501 [2021-07-09 16:51:50,419 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 74.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6501 states. [2021-07-09 16:51:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6501 to 5751. [2021-07-09 16:51:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5751 states, 5750 states have (on average 3.3389565217391306) internal successors, (19199), 5750 states have internal predecessors, (19199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5751 states to 5751 states and 19199 transitions. [2021-07-09 16:51:50,583 INFO L78 Accepts]: Start accepts. Automaton has 5751 states and 19199 transitions. Word has length 72 [2021-07-09 16:51:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:50,583 INFO L482 AbstractCegarLoop]: Abstraction has 5751 states and 19199 transitions. [2021-07-09 16:51:50,583 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5751 states and 19199 transitions. [2021-07-09 16:51:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:51:50,593 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:50,593 INFO L508 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] [2021-07-09 16:51:50,594 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 16:51:50,594 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:50,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1745837991, now seen corresponding path program 1 times [2021-07-09 16:51:50,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:50,594 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153808264] [2021-07-09 16:51:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:50,790 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:50,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153808264] [2021-07-09 16:51:50,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153808264] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:50,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:50,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 16:51:50,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303115156] [2021-07-09 16:51:50,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 16:51:50,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:50,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 16:51:50,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:51:50,791 INFO L87 Difference]: Start difference. First operand 5751 states and 19199 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:50,993 INFO L93 Difference]: Finished difference Result 6863 states and 22898 transitions. [2021-07-09 16:51:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:51:50,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-07-09 16:51:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:51,009 INFO L225 Difference]: With dead ends: 6863 [2021-07-09 16:51:51,009 INFO L226 Difference]: Without dead ends: 6263 [2021-07-09 16:51:51,010 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 106.3ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:51:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2021-07-09 16:51:51,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 5863. [2021-07-09 16:51:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5863 states, 5862 states have (on average 3.342033435687479) internal successors, (19591), 5862 states have internal predecessors, (19591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5863 states to 5863 states and 19591 transitions. [2021-07-09 16:51:51,141 INFO L78 Accepts]: Start accepts. Automaton has 5863 states and 19591 transitions. Word has length 73 [2021-07-09 16:51:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:51,141 INFO L482 AbstractCegarLoop]: Abstraction has 5863 states and 19591 transitions. [2021-07-09 16:51:51,141 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5863 states and 19591 transitions. [2021-07-09 16:51:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:51:51,151 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:51,151 INFO L508 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] [2021-07-09 16:51:51,151 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 16:51:51,151 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash -511051197, now seen corresponding path program 2 times [2021-07-09 16:51:51,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:51,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219571805] [2021-07-09 16:51:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:51,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:51,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219571805] [2021-07-09 16:51:51,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219571805] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:51,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:51,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:51:51,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111777818] [2021-07-09 16:51:51,319 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:51:51,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:51,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:51:51,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:51,320 INFO L87 Difference]: Start difference. First operand 5863 states and 19591 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:51,611 INFO L93 Difference]: Finished difference Result 7141 states and 23696 transitions. [2021-07-09 16:51:51,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:51:51,612 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-07-09 16:51:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:51,627 INFO L225 Difference]: With dead ends: 7141 [2021-07-09 16:51:51,627 INFO L226 Difference]: Without dead ends: 5701 [2021-07-09 16:51:51,627 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 220.2ms TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:51:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2021-07-09 16:51:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 5673. [2021-07-09 16:51:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5673 states, 5672 states have (on average 3.321227080394922) internal successors, (18838), 5672 states have internal predecessors, (18838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5673 states to 5673 states and 18838 transitions. [2021-07-09 16:51:51,746 INFO L78 Accepts]: Start accepts. Automaton has 5673 states and 18838 transitions. Word has length 73 [2021-07-09 16:51:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:51,746 INFO L482 AbstractCegarLoop]: Abstraction has 5673 states and 18838 transitions. [2021-07-09 16:51:51,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5673 states and 18838 transitions. [2021-07-09 16:51:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:51:51,757 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:51,757 INFO L508 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] [2021-07-09 16:51:51,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 16:51:51,757 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:51,757 INFO L82 PathProgramCache]: Analyzing trace with hash 345013795, now seen corresponding path program 3 times [2021-07-09 16:51:51,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:51,758 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532290081] [2021-07-09 16:51:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:51,879 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:51,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532290081] [2021-07-09 16:51:51,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532290081] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:51,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:51,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 16:51:51,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963462757] [2021-07-09 16:51:51,880 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 16:51:51,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:51,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 16:51:51,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:51:51,880 INFO L87 Difference]: Start difference. First operand 5673 states and 18838 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:52,152 INFO L93 Difference]: Finished difference Result 6665 states and 22101 transitions. [2021-07-09 16:51:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:51:52,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-07-09 16:51:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:52,168 INFO L225 Difference]: With dead ends: 6665 [2021-07-09 16:51:52,168 INFO L226 Difference]: Without dead ends: 5985 [2021-07-09 16:51:52,169 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 224.2ms TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:51:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2021-07-09 16:51:52,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 5739. [2021-07-09 16:51:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5739 states, 5738 states have (on average 3.322411990240502) internal successors, (19064), 5738 states have internal predecessors, (19064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 19064 transitions. [2021-07-09 16:51:52,298 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 19064 transitions. Word has length 73 [2021-07-09 16:51:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:52,298 INFO L482 AbstractCegarLoop]: Abstraction has 5739 states and 19064 transitions. [2021-07-09 16:51:52,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 19064 transitions. [2021-07-09 16:51:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:51:52,308 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:52,309 INFO L508 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] [2021-07-09 16:51:52,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 16:51:52,309 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:52,309 INFO L82 PathProgramCache]: Analyzing trace with hash -908356165, now seen corresponding path program 1 times [2021-07-09 16:51:52,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:52,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496390787] [2021-07-09 16:51:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:52,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:52,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496390787] [2021-07-09 16:51:52,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496390787] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:52,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:52,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:52,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76156869] [2021-07-09 16:51:52,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:52,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:52,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:52,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:52,376 INFO L87 Difference]: Start difference. First operand 5739 states and 19064 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:52,500 INFO L93 Difference]: Finished difference Result 8979 states and 29350 transitions. [2021-07-09 16:51:52,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:52,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-07-09 16:51:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:52,517 INFO L225 Difference]: With dead ends: 8979 [2021-07-09 16:51:52,517 INFO L226 Difference]: Without dead ends: 6171 [2021-07-09 16:51:52,517 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2021-07-09 16:51:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 5403. [2021-07-09 16:51:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5403 states, 5402 states have (on average 3.2317660125879306) internal successors, (17458), 5402 states have internal predecessors, (17458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 17458 transitions. [2021-07-09 16:51:52,648 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 17458 transitions. Word has length 73 [2021-07-09 16:51:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:52,648 INFO L482 AbstractCegarLoop]: Abstraction has 5403 states and 17458 transitions. [2021-07-09 16:51:52,648 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 17458 transitions. [2021-07-09 16:51:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:51:52,658 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:52,658 INFO L508 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] [2021-07-09 16:51:52,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 16:51:52,658 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:52,659 INFO L82 PathProgramCache]: Analyzing trace with hash 284003412, now seen corresponding path program 1 times [2021-07-09 16:51:52,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:52,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621404051] [2021-07-09 16:51:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:52,850 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:52,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621404051] [2021-07-09 16:51:52,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621404051] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:52,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:52,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:51:52,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690127253] [2021-07-09 16:51:52,851 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:51:52,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:52,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:51:52,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:51:52,851 INFO L87 Difference]: Start difference. First operand 5403 states and 17458 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:53,119 INFO L93 Difference]: Finished difference Result 6347 states and 20314 transitions. [2021-07-09 16:51:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:51:53,119 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-07-09 16:51:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:53,135 INFO L225 Difference]: With dead ends: 6347 [2021-07-09 16:51:53,136 INFO L226 Difference]: Without dead ends: 5632 [2021-07-09 16:51:53,136 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 219.6ms TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:51:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5632 states. [2021-07-09 16:51:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5632 to 5452. [2021-07-09 16:51:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5452 states, 5451 states have (on average 3.2241790497156484) internal successors, (17575), 5451 states have internal predecessors, (17575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5452 states to 5452 states and 17575 transitions. [2021-07-09 16:51:53,261 INFO L78 Accepts]: Start accepts. Automaton has 5452 states and 17575 transitions. Word has length 74 [2021-07-09 16:51:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:53,261 INFO L482 AbstractCegarLoop]: Abstraction has 5452 states and 17575 transitions. [2021-07-09 16:51:53,262 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5452 states and 17575 transitions. [2021-07-09 16:51:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:51:53,271 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:53,271 INFO L508 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] [2021-07-09 16:51:53,271 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 16:51:53,271 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash -960084680, now seen corresponding path program 2 times [2021-07-09 16:51:53,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:53,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231138645] [2021-07-09 16:51:53,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:53,490 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:53,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231138645] [2021-07-09 16:51:53,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231138645] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:53,490 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:53,490 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:51:53,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344007507] [2021-07-09 16:51:53,490 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:51:53,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:53,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:51:53,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:51:53,491 INFO L87 Difference]: Start difference. First operand 5452 states and 17575 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:53,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:53,799 INFO L93 Difference]: Finished difference Result 6282 states and 20192 transitions. [2021-07-09 16:51:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:51:53,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-07-09 16:51:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:53,812 INFO L225 Difference]: With dead ends: 6282 [2021-07-09 16:51:53,813 INFO L226 Difference]: Without dead ends: 5652 [2021-07-09 16:51:53,813 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 287.9ms TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:51:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2021-07-09 16:51:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5323. [2021-07-09 16:51:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5323 states, 5322 states have (on average 3.2290492296129276) internal successors, (17185), 5322 states have internal predecessors, (17185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 5323 states and 17185 transitions. [2021-07-09 16:51:53,933 INFO L78 Accepts]: Start accepts. Automaton has 5323 states and 17185 transitions. Word has length 74 [2021-07-09 16:51:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:53,933 INFO L482 AbstractCegarLoop]: Abstraction has 5323 states and 17185 transitions. [2021-07-09 16:51:53,933 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 17185 transitions. [2021-07-09 16:51:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:51:53,942 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:53,942 INFO L508 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] [2021-07-09 16:51:53,942 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 16:51:53,942 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:53,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:53,943 INFO L82 PathProgramCache]: Analyzing trace with hash -191873704, now seen corresponding path program 3 times [2021-07-09 16:51:53,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:53,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018011597] [2021-07-09 16:51:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:54,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:54,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018011597] [2021-07-09 16:51:54,119 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018011597] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:54,119 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:54,119 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:51:54,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397394199] [2021-07-09 16:51:54,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:51:54,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:54,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:51:54,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:51:54,120 INFO L87 Difference]: Start difference. First operand 5323 states and 17185 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:54,358 INFO L93 Difference]: Finished difference Result 7491 states and 23971 transitions. [2021-07-09 16:51:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:51:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-07-09 16:51:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:54,369 INFO L225 Difference]: With dead ends: 7491 [2021-07-09 16:51:54,370 INFO L226 Difference]: Without dead ends: 4661 [2021-07-09 16:51:54,370 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 205.3ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:51:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2021-07-09 16:51:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 3836. [2021-07-09 16:51:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 3835 states have (on average 3.1994784876140807) internal successors, (12270), 3835 states have internal predecessors, (12270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 12270 transitions. [2021-07-09 16:51:54,453 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 12270 transitions. Word has length 74 [2021-07-09 16:51:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:54,453 INFO L482 AbstractCegarLoop]: Abstraction has 3836 states and 12270 transitions. [2021-07-09 16:51:54,453 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 12270 transitions. [2021-07-09 16:51:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:51:54,460 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:54,460 INFO L508 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] [2021-07-09 16:51:54,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-09 16:51:54,460 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1149749234, now seen corresponding path program 1 times [2021-07-09 16:51:54,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:54,460 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996772210] [2021-07-09 16:51:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:54,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:54,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996772210] [2021-07-09 16:51:54,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996772210] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:54,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:54,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:54,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714419459] [2021-07-09 16:51:54,531 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:54,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:54,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:54,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:54,531 INFO L87 Difference]: Start difference. First operand 3836 states and 12270 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:54,623 INFO L93 Difference]: Finished difference Result 4692 states and 14710 transitions. [2021-07-09 16:51:54,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-07-09 16:51:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:54,631 INFO L225 Difference]: With dead ends: 4692 [2021-07-09 16:51:54,631 INFO L226 Difference]: Without dead ends: 3380 [2021-07-09 16:51:54,633 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 65.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2021-07-09 16:51:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3380. [2021-07-09 16:51:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 3.1358390056229655) internal successors, (10596), 3379 states have internal predecessors, (10596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 10596 transitions. [2021-07-09 16:51:54,758 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 10596 transitions. Word has length 74 [2021-07-09 16:51:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:54,759 INFO L482 AbstractCegarLoop]: Abstraction has 3380 states and 10596 transitions. [2021-07-09 16:51:54,759 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 10596 transitions. [2021-07-09 16:51:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-09 16:51:54,766 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:54,767 INFO L508 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] [2021-07-09 16:51:54,767 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-09 16:51:54,767 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:54,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:54,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2120187312, now seen corresponding path program 1 times [2021-07-09 16:51:54,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:54,767 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373333955] [2021-07-09 16:51:54,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:54,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-07-09 16:51:54,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:54,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373333955] [2021-07-09 16:51:54,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373333955] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:54,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:54,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:51:54,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594137437] [2021-07-09 16:51:54,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:51:54,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:54,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:51:54,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:51:54,829 INFO L87 Difference]: Start difference. First operand 3380 states and 10596 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:54,923 INFO L93 Difference]: Finished difference Result 3422 states and 10426 transitions. [2021-07-09 16:51:54,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 16:51:54,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-07-09 16:51:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:54,928 INFO L225 Difference]: With dead ends: 3422 [2021-07-09 16:51:54,928 INFO L226 Difference]: Without dead ends: 2354 [2021-07-09 16:51:54,928 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 70.1ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:51:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2021-07-09 16:51:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2021-07-09 16:51:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 2353 states have (on average 3.008924776880578) internal successors, (7080), 2353 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 7080 transitions. [2021-07-09 16:51:54,962 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 7080 transitions. Word has length 75 [2021-07-09 16:51:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:54,962 INFO L482 AbstractCegarLoop]: Abstraction has 2354 states and 7080 transitions. [2021-07-09 16:51:54,962 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 7080 transitions. [2021-07-09 16:51:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-09 16:51:54,965 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:54,965 INFO L508 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] [2021-07-09 16:51:54,965 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-09 16:51:54,966 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:54,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash 56488871, now seen corresponding path program 1 times [2021-07-09 16:51:54,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:54,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047294669] [2021-07-09 16:51:54,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:55,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:55,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047294669] [2021-07-09 16:51:55,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047294669] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:55,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:55,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 16:51:55,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695465622] [2021-07-09 16:51:55,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 16:51:55,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:55,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 16:51:55,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-09 16:51:55,033 INFO L87 Difference]: Start difference. First operand 2354 states and 7080 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:55,134 INFO L93 Difference]: Finished difference Result 1940 states and 5673 transitions. [2021-07-09 16:51:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:51:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-07-09 16:51:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:55,136 INFO L225 Difference]: With dead ends: 1940 [2021-07-09 16:51:55,136 INFO L226 Difference]: Without dead ends: 794 [2021-07-09 16:51:55,136 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 84.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:51:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-07-09 16:51:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2021-07-09 16:51:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 2.7919293820933166) internal successors, (2214), 793 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2214 transitions. [2021-07-09 16:51:55,146 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2214 transitions. Word has length 77 [2021-07-09 16:51:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:55,146 INFO L482 AbstractCegarLoop]: Abstraction has 794 states and 2214 transitions. [2021-07-09 16:51:55,146 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2214 transitions. [2021-07-09 16:51:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-09 16:51:55,147 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:55,147 INFO L508 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] [2021-07-09 16:51:55,147 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-09 16:51:55,147 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:55,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:55,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1212992908, now seen corresponding path program 1 times [2021-07-09 16:51:55,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:55,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871218337] [2021-07-09 16:51:55,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:51:55,169 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:51:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:51:55,193 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:51:55,216 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 16:51:55,217 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 16:51:55,217 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-09 16:51:55,217 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-09 16:51:55,218 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 16:51:55,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 04:51:55 BasicIcfg [2021-07-09 16:51:55,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 16:51:55,287 INFO L168 Benchmark]: Toolchain (without parser) took 11490.36 ms. Allocated memory was 204.5 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 167.2 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 389.3 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:55,287 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 204.5 MB. Free memory is still 185.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 16:51:55,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.91 ms. Allocated memory is still 204.5 MB. Free memory was 167.0 MB in the beginning and 174.7 MB in the end (delta: -7.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:55,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.99 ms. Allocated memory is still 204.5 MB. Free memory was 174.7 MB in the beginning and 172.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:55,287 INFO L168 Benchmark]: Boogie Preprocessor took 49.31 ms. Allocated memory is still 204.5 MB. Free memory was 172.1 MB in the beginning and 170.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:55,287 INFO L168 Benchmark]: RCFGBuilder took 1359.28 ms. Allocated memory is still 204.5 MB. Free memory was 170.0 MB in the beginning and 81.8 MB in the end (delta: 88.1 MB). Peak memory consumption was 106.5 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:55,287 INFO L168 Benchmark]: TraceAbstraction took 9557.37 ms. Allocated memory was 204.5 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 81.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 302.7 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:55,288 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 204.5 MB. Free memory is still 185.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 443.91 ms. Allocated memory is still 204.5 MB. Free memory was 167.0 MB in the beginning and 174.7 MB in the end (delta: -7.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 60.99 ms. Allocated memory is still 204.5 MB. Free memory was 174.7 MB in the beginning and 172.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 49.31 ms. Allocated memory is still 204.5 MB. Free memory was 172.1 MB in the beginning and 170.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1359.28 ms. Allocated memory is still 204.5 MB. Free memory was 170.0 MB in the beginning and 81.8 MB in the end (delta: 88.1 MB). Peak memory consumption was 106.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9557.37 ms. Allocated memory was 204.5 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 81.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 302.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2498; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2499; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2500; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 468.5ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 24.4ms, AutomataDifference: 88.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 138.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 88 SDtfs, 35 SDslu, 25 SDs, 0 SdLazy, 3 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5015occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5.7ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.5ms SsaConstructionTime, 30.4ms SatisfiabilityAnalysisTime, 101.6ms InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8909.6ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 233.7ms, AutomataDifference: 3765.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 156.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2287 SDtfs, 3500 SDslu, 9317 SDs, 0 SdLazy, 1220 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 953.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2626.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8543occurred in iteration=0, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2204.3ms AutomataMinimizationTime, 16 MinimizatonAttempts, 3638 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 42.9ms SsaConstructionTime, 386.0ms SatisfiabilityAnalysisTime, 1963.1ms InterpolantComputationTime, 1238 NumberOfCodeBlocks, 1238 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1142 ConstructedInterpolants, 0 QuantifiedInterpolants, 6438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...